| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs | Fomin, Fedor V. et al. | 2013 |
| 2 | Subexponential Parameterized Odd Cycle Transversal on Planar Graphs | Lokshtanov, Daniel et al. | 2012 |
| 3 | Hitting forbidden minors: Approximation and Kernelization | Fomin, Fedor V. et al. | 2011 |
| 4 | Obtaining a Bipartite Graph by Contracting Few Edges | Heggernes, Pinar et al. | 2011 |
| 5 | Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs | Dorn, Frederic et al. | 2010 |
| 6 | Determining the Winner of a Dodgson Election is Hard | Fellows, Michael et al. | 2010 |
| 7 | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves | Fernau, Henning et al. | 2009 |
| 8 | Subexponential Algorithms for Partial Cover Problems | Fomin, Fedor V. et al. | 2009 |
| Number of result pages: | 1 |
| Number of documents: | 8 |
