| No. |
Title |
Author |
Year |
| 1 |
Finding a Highly Connected Steiner Subgraph and its Applications |
Eiben, Eduard et al. |
2023 |
| 2 |
An Exact Algorithm for Knot-Free Vertex Deletion |
Ramanujan, M. S. et al. |
2022 |
| 3 |
Backdoor Sets on Nowhere Dense SAT |
Lokshtanov, Daniel et al. |
2022 |
| 4 |
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs |
Agrawal, Akanksha et al. |
2021 |
| 5 |
On Approximate Compressions for Connected Minor-Hitting Sets |
Ramanujan, M. S. |
2021 |
| 6 |
On the Complexity of Recovering Incidence Matrices |
Fomin, Fedor V. et al. |
2020 |
| 7 |
On the Parameterized Complexity of Clique Elimination Distance |
Agrawal, Akanksha et al. |
2020 |
| 8 |
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components |
Neogi, Rian et al. |
2020 |
| 9 |
An Approximate Kernel for Connected Feedback Vertex Set |
Ramanujan, M. S. |
2019 |
| 10 |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS |
Lokshtanov, Daniel et al. |
2018 |
| 11 |
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming |
Fomin, Fedor V. et al. |
2018 |
| 12 |
On the Parameterized Complexity of Simultaneous Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 13 |
Reducing CMSO Model Checking to Highly Connected Graphs |
Lokshtanov, Daniel et al. |
2018 |
| 14 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |
| 15 |
Combining Treewidth and Backdoors for CSP |
Ganian, Robert et al. |
2017 |
| 16 |
Lossy Kernels for Hitting Subgraphs |
Eiben, Eduard et al. |
2017 |
| 17 |
Path-Contractions, Edge Deletions and Connectivity Preservation |
Gutin, Gregory et al. |
2017 |
| 18 |
Saving Critical Nodes with Firefighters is FPT |
Choudhari, Jayesh et al. |
2017 |
| 19 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set |
Bergougnoux, Benjamin et al. |
2017 |
| 20 |
On the Complexity Landscape of Connected f-Factor Problems |
Ganian, Robert et al. |
2016 |
| 21 |
Strong Parameterized Deletion: Bipartite Graphs |
Rai, Ashutosh et al. |
2016 |
| 22 |
Vertex Exponential Algorithms for Connected f-Factors |
Philip, Geevarghese et al. |
2014 |
| 23 |
Backdoors to q-Horn |
Gaspers, Serge et al. |
2013 |
| 24 |
Partially Polynomial Kernels for Set Cover and Test Cover |
Basavaraju, Manu et al. |
2013 |
