| No. |
Title |
Author |
Year |
| 1 |
An Approximate Kernel for Connected Feedback Vertex Set |
Ramanujan, M. S. |
2019 |
| 2 |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS |
Lokshtanov, Daniel et al. |
2018 |
| 3 |
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming |
Fomin, Fedor V. et al. |
2018 |
| 4 |
On the Parameterized Complexity of Simultaneous Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 5 |
Reducing CMSO Model Checking to Highly Connected Graphs |
Lokshtanov, Daniel et al. |
2018 |
| 6 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |
| 7 |
Combining Treewidth and Backdoors for CSP |
Ganian, Robert et al. |
2017 |
| 8 |
Lossy Kernels for Hitting Subgraphs |
Eiben, Eduard et al. |
2017 |
| 9 |
Path-Contractions, Edge Deletions and Connectivity Preservation |
Gutin, Gregory et al. |
2017 |
| 10 |
Saving Critical Nodes with Firefighters is FPT |
Choudhari, Jayesh et al. |
2017 |
