1 – 10 of 13
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2019
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- 2015
- Induced subgraph isomorphism: Are some patterns substantially easier than others?
- Detecting and Counting Small Pattern Graphs
- 2013
- Counting and Detecting Small Subgraphs via Equations
- Detecting and Counting Small Pattern Graphs
- Unique subgraphs are not easier to find
- 2009
- Efficient approximation algorithms for shortest cycles in undirected graphs
- 2008
- Efficient approximation algorithms for shortest cycles in undirected graphs
- 2007
- Polynomial-time algorithms for the ordered maximum agreement subtree problem
- On the approximability of maximum and minimum edge clique partition problems