| No. |
Title |
Author |
Year |
| 1 |
Diverse Collections in Matroids and Graphs |
Fomin, Fedor V. et al. |
2021 |
| 2 |
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion |
Lokshtanov, Daniel et al. |
2020 |
| 3 |
Diverse Pairs of Matchings |
Fomin, Fedor V. et al. |
2020 |
| 4 |
Structural Parameterizations of Clique Coloring |
Jaffke, Lars et al. |
2020 |
| 5 |
B-Chromatic Number: Beyond NP-Hardness |
Panolan, Fahad et al. |
2015 |
| 6 |
Finding Even Subgraphs Even Faster |
Goyal, Prachi et al. |
2015 |
| 7 |
Vertex Exponential Algorithms for Connected f-Factors |
Philip, Geevarghese et al. |
2014 |
| 8 |
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound |
Crowston, Robert et al. |
2013 |
| 9 |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound |
Mnich, Matthias et al. |
2012 |
| 10 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |
| 11 |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation |
Fomin, Fedor V. et al. |
2011 |
| 12 |
The effect of girth on the kernelization complexity of Connected Dominating Set |
Misra, Neeldhara et al. |
2010 |
