11 – 18 of 18
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- « previous
- 1
- 2
- next »
- 2015
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
- 2013
-
Mark
Counting and Detecting Small Subgraphs via Equations
(
- Contribution to journal › Article
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
- 2008
-
Mark
A path cover technique for LCAs in dags
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
- « previous
- 1
- 2
- next »