1 – 13 of 13
- show: 15
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2019
-
Mark
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
- 2015
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Contribution to journal › Article
-
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
Detecting and Counting Small Pattern Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
- 2009
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Contribution to journal › Article
- 2008
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Contribution to journal › Article
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
- 2006
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2004
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Subexponential-time framework for optimal embeddings of graphs in integer lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding