| No. |
Title |
Author |
Year |
| 1 |
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii |
Bandyapadhyay, Sayan et al. |
2023 |
| 2 |
Minimum-Membership Geometric Set Cover, Revisited |
Bandyapadhyay, Sayan et al. |
2023 |
| 3 |
Detours in Directed Graphs |
Fomin, Fedor V. et al. |
2022 |
| 4 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs |
Bandyapadhyay, Sayan et al. |
2022 |
| 5 |
Exploiting Dense Structures in Parameterized Complexity |
Lochet, William et al. |
2021 |
| 6 |
A Polynomial Kernel for Line Graph Deletion |
Eiben, Eduard et al. |
2020 |
| 7 |
A Polynomial Kernel for Paw-Free Editing |
Eiben, Eduard et al. |
2020 |
| 8 |
Fault Tolerant Subgraphs with Applications in Kernelization |
Lochet, William et al. |
2020 |
| 9 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |
| 10 |
Exact and Approximate Digraph Bandwidth |
Jain, Pallavi et al. |
2019 |
