| No. |
Title |
Author |
Year |
| 1 |
Backdoor Sets on Nowhere Dense SAT |
Lokshtanov, Daniel et al. |
2022 |
| 2 |
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles |
Kumar, Neeraj et al. |
2022 |
| 3 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs |
Bandyapadhyay, Sayan et al. |
2022 |
| 4 |
Wordle Is NP-Hard |
Lokshtanov, Daniel et al. |
2022 |
| 5 |
An ETH-Tight Algorithm for Multi-Team Formation |
Lokshtanov, Daniel et al. |
2021 |
| 6 |
b-Coloring Parameterized by Clique-Width |
Jaffke, Lars et al. |
2021 |
| 7 |
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable |
Lokshtanov, Daniel et al. |
2021 |
| 8 |
Efficient Algorithms for Least Square Piecewise Polynomial Regression |
Lokshtanov, Daniel et al. |
2021 |
| 9 |
Exploiting Dense Structures in Parameterized Complexity |
Lochet, William et al. |
2021 |
| 10 |
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion |
Lokshtanov, Daniel et al. |
2020 |
| 11 |
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds |
Fomin, Fedor V. et al. |
2020 |
| 12 |
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2020 |
| 13 |
Fault Tolerant Subgraphs with Applications in Kernelization |
Lochet, William et al. |
2020 |
| 14 |
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs |
Gunda, Spoorthy et al. |
2020 |
| 15 |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets |
Lokshtanov, Daniel et al. |
2020 |
| 16 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |
| 17 |
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs |
Choudhary, Pratibha et al. |
2020 |
| 18 |
Removing Connected Obstacles in the Plane Is FPT |
Eiben, Eduard et al. |
2020 |
| 19 |
The Parameterized Complexity of Guarding Almost Convex Polygons |
Agrawal, Akanksha et al. |
2020 |
| 20 |
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem |
Lokshtanov, Daniel et al. |
2019 |
| 21 |
Approximate Counting of k-Paths: Deterministic and in Polynomial Space |
Björklund, Andreas et al. |
2019 |
| 22 |
Bisection of Bounded Treewidth Graphs by Convolutions |
Eiben, Eduard et al. |
2019 |
| 23 |
Computing the Largest Bond of a Graph |
Duarte, Gabriel L. et al. |
2019 |
| 24 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |
| 25 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |
| 26 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |
| 27 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |
| 28 |
Picking Random Vertices (Invited Talk) |
Lokshtanov, Daniel |
2019 |
| 29 |
The Parameterized Complexity of Finding Point Sets with Hereditary Properties |
Eppstein, David et al. |
2019 |
| 30 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |
