| No. |
Title |
Author |
Year |
| 1 |
On the Parameterized Complexity of Simultaneous Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 2 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |
| 3 |
Combining Treewidth and Backdoors for CSP |
Ganian, Robert et al. |
2017 |
| 4 |
Lossy Kernels for Hitting Subgraphs |
Eiben, Eduard et al. |
2017 |
| 5 |
Path-Contractions, Edge Deletions and Connectivity Preservation |
Gutin, Gregory et al. |
2017 |
| 6 |
Saving Critical Nodes with Firefighters is FPT |
Choudhari, Jayesh et al. |
2017 |
| 7 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set |
Bergougnoux, Benjamin et al. |
2017 |
| 8 |
On the Complexity Landscape of Connected f-Factor Problems |
Ganian, Robert et al. |
2016 |
| 9 |
Strong Parameterized Deletion: Bipartite Graphs |
Rai, Ashutosh et al. |
2016 |
| 10 |
Vertex Exponential Algorithms for Connected f-Factors |
Philip, Geevarghese et al. |
2014 |
