| No. |
Title |
Author |
Year |
| 1 |
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width |
Bergé, Pierre et al. |
2023 |
| 2 |
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄ |
Bonnet, Édouard et al. |
2023 |
| 3 |
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication |
Bonnet, Édouard et al. |
2023 |
| 4 |
Deciding Twin-Width at Most 4 Is NP-Complete |
Bergé, Pierre et al. |
2022 |
| 5 |
Twin-Width VIII: Delineation and Win-Wins |
Bonnet, Édouard et al. |
2022 |
| 6 |
4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3} |
Bonnet, Édouard |
2021 |
| 7 |
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio |
Bonnet, Édouard |
2021 |
| 8 |
Twin-Width and Polynomial Kernels |
Bonnet, Édouard et al. |
2021 |
| 9 |
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring |
Bonnet, Édouard et al. |
2021 |
| 10 |
An Algorithmic Weakening of the Erdős-Hajnal Conjecture |
Bonnet, Édouard et al. |
2020 |
| 11 |
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth |
Bergougnoux, Benjamin et al. |
2020 |
| 12 |
Grundy Coloring & Friends, Half-Graphs, Bicliques |
Aboulker, Pierre et al. |
2020 |
| 13 |
Maximum Clique in Disk-Like Intersection Graphs |
Bonnet, Édouard et al. |
2020 |
| 14 |
Maximum Matchings in Geometric Intersection Graphs |
Bonnet, Édouard et al. |
2020 |
| 15 |
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP |
Bonnet, Édouard et al. |
2019 |
| 16 |
Metric Dimension Parameterized by Treewidth |
Bonnet, Édouard et al. |
2019 |
| 17 |
Parameterized Complexity of Independent Set in H-Free Graphs |
Bonnet, Édouard et al. |
2019 |
| 18 |
Parameterized Streaming Algorithms for Min-Ones d-SAT |
Agrawal, Akanksha et al. |
2019 |
| 19 |
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration |
Bonnet, Édouard et al. |
2019 |
| 20 |
When Maximum Stable Set Can Be Solved in FPT Time |
Bonnet, Édouard et al. |
2019 |
| 21 |
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms |
Bonnet, Édouard et al. |
2018 |
| 22 |
On the Parameterized Complexity of Red-Blue Points Separation |
Bonnet, Édouard et al. |
2018 |
| 23 |
Orthogonal Terrain Guarding is NP-complete |
Bonnet, Édouard et al. |
2018 |
| 24 |
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs |
Bonnet, Édouard et al. |
2018 |
| 25 |
An Approximation Algorithm for the Art Gallery Problem |
Bonnet, Édouard et al. |
2017 |
| 26 |
Complexity of Token Swapping and its Variants |
Bonnet, Édouard et al. |
2017 |
| 27 |
Fine-Grained Complexity of Coloring Unit Disks and Balls |
Biró, Csaba et al. |
2017 |
| 28 |
The Parameterized Complexity of Positional Games |
Bonnet, Édouard et al. |
2017 |
| 29 |
Fixed-Parameter Approximability of Boolean MinCSPs |
Bonnet, Édouard et al. |
2016 |
| 30 |
Parameterized Hardness of Art Gallery Problems |
Bonnet, Édouard et al. |
2016 |
| 31 |
Time-Approximation Trade-offs for Inapproximable Problems |
Bonnet, Édouard et al. |
2016 |
| 32 |
The Graph Motif Problem Parameterized by the Structure of the Input Graph |
Bonnet, Édouard et al. |
2015 |
