1 – 8 of 8
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2017
-
Mark
Counting thin subgraphs via packings faster than meet-in-the-middle time
(
- Contribution to journal › Article
-
Mark
Spotting Trees with Few Leaves
(
- Contribution to journal › Article
- 2016
-
Mark
Constrained Multilinear Detection and Generalized Graph Motifs
(
- Contribution to journal › Article
- 2015
-
Mark
Spotting Trees with Few Leaves
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Engineering Motif Search for Large Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
Fast Witness Extraction using a Decision Oracle
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
Probably Optimal Graph Motifs
2013) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), LIPIcs 20. p.20-31(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding