| No. |
Title |
Author |
Year |
| 1 |
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k |
Kanté, Mamadou Moustapha et al. |
2022 |
| 2 |
Twin-Width VIII: Delineation and Win-Wins |
Bonnet, Édouard et al. |
2022 |
| 3 |
A Constant-Factor Approximation for Weighted Bond Cover |
Kim, Eun Jung et al. |
2021 |
| 4 |
Twin-Width and Polynomial Kernels |
Bonnet, Édouard et al. |
2021 |
| 5 |
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring |
Bonnet, Édouard et al. |
2021 |
| 6 |
Grundy Coloring & Friends, Half-Graphs, Bicliques |
Aboulker, Pierre et al. |
2020 |
| 7 |
Grundy Distinguishes Treewidth from Pathwidth |
Belmonte, Rémy et al. |
2020 |
| 8 |
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion |
Ahn, Jungho et al. |
2020 |
| 9 |
Token Sliding on Split Graphs |
Belmonte, Rémy et al. |
2019 |
| 10 |
Data-Compression for Parametrized Counting Problems on Sparse Graphs |
Kim, Eun Jung et al. |
2018 |
| 11 |
Finding Branch-Decompositions of Matroids, Hypergraphs, and More |
Jeong, Jisu et al. |
2018 |
| 12 |
New Results on Directed Edge Dominating Set |
Belmonte, Rémy et al. |
2018 |
| 13 |
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs |
Bonnet, Édouard et al. |
2018 |
| 14 |
A Polynomial Kernel for Block Graph Deletion |
Kim, Eun Jung et al. |
2015 |
| 15 |
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion |
Kanté, Mamadou Moustapha et al. |
2015 |
| 16 |
Complexity and Approximability of Parameterized MAX-CSPs |
Dell, Holger et al. |
2015 |
| 17 |
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
Kim, Eun Jung et al. |
2015 |
