| No. |
Title |
Author |
Year |
| 1 |
Backdoors to q-Horn |
Gaspers, Serge et al. |
2013 |
| 2 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |
| 3 |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound |
Mnich, Matthias et al. |
2012 |
| 4 |
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) |
Fellows, Michael R. et al. |
2012 |
| 5 |
LP can be a cure for Parameterized Problems |
Narayanaswamy, N.S. et al. |
2012 |
| 6 |
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs |
Lokshtanov, Daniel et al. |
2012 |
| 7 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |
| 8 |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
Dorn, Frederic et al. |
2010 |
| 9 |
Determining the Winner of a Dodgson Election is Hard |
Fellows, Michael et al. |
2010 |
| 10 |
The effect of girth on the kernelization complexity of Connected Dominating Set |
Misra, Neeldhara et al. |
2010 |
