| No. |
Title |
Author |
Year |
| 1 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |
| 2 |
Searching for better fill-in |
Fomin, Fedor V. et al. |
2013 |
| 3 |
Tight bounds for Parameterized Complexity of Cluster Editing |
Fomin, Fedor V. et al. |
2013 |
| 4 |
Parameterized Complexity of Connected Even/Odd Subgraph Problems |
Fomin, Fedor V. et al. |
2012 |
| 5 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |
| 6 |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation |
Fomin, Fedor V. et al. |
2011 |
| 7 |
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) |
Fomin, Fedor V. et al. |
2011 |
| 8 |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
Dorn, Frederic et al. |
2010 |
| 9 |
Contraction Bidimensionality: the Accurate Picture |
Fomin, Fedor V. et al. |
2010 |
| 10 |
Finding Induced Subgraphs via Minimal Triangulations |
Fomin, Fedor V. et al. |
2010 |
