| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Searching for better fill-in | Fomin, Fedor V. et al. | 2013 |
| 2 | Tight bounds for Parameterized Complexity of Cluster Editing | Fomin, Fedor V. et al. | 2013 |
| 3 | Minimum Fill-in of Sparse Graphs: Kernelization and Approximation | Fomin, Fedor V. et al. | 2011 |
| 4 | Finding Induced Subgraphs via Minimal Triangulations | Fomin, Fedor V. et al. | 2010 |
| 5 | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves | Fernau, Henning et al. | 2009 |
| Number of result pages: | 1 |
| Number of documents: | 5 |
