| No. |
Title |
Author |
Year |
| 1 |
A 2lk Kernel for l-Component Order Connectivity |
Kumar, Mithilesh et al. |
2017 |
| 2 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |
| 3 |
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2017 |
| 4 |
Matrix Rigidity from the Viewpoint of Parameterized Complexity |
Fomin, Fedor V. et al. |
2017 |
| 5 |
Packing Cycles Faster Than Erdos-Posa |
Lokshtanov, Daniel et al. |
2017 |
| 6 |
Split Contraction: The Untold Story |
Agrawal, Akanksha et al. |
2017 |
| 7 |
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments |
Kumar, Mithilesh et al. |
2016 |
| 8 |
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments |
Kumar, Mithilesh et al. |
2016 |
| 9 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 10 |
Kernelization of Cycle Packing with Relaxed Disjointness Constraints |
Agrawal, Akanksha et al. |
2016 |
