1 – 5 of 5
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2019
- A fast deterministic detection of small pattern graphs in graphs without large cliques (
- 2018
- Are unique subgraphs not easier to find? (
- 2017
- A fast deterministic detection of small pattern graphs in graphs without large cliques (
- 2015
- Induced subgraph isomorphism: Are some patterns substantially easier than others? (
- 2013
- Unique subgraphs are not easier to find (