| No. |
Title |
Author |
Year |
| 1 |
Distributed Recoloring of Interval and Chordal Graphs |
Bousquet, Nicolas et al. |
2022 |
| 2 |
Local Certification of Graph Decompositions and Applications to Minor-Free Classes |
Bousquet, Nicolas et al. |
2022 |
| 3 |
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint |
Bousquet, Nicolas et al. |
2022 |
| 4 |
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes |
Bathie, Gabriel et al. |
2021 |
| 5 |
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes |
Bousquet, Nicolas et al. |
2021 |
| 6 |
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters |
Bartier, Valentin et al. |
2021 |
| 7 |
PACE Solver Description: μSolver - Heuristic Track |
Bartier, Valentin et al. |
2021 |
| 8 |
Linear Transformations Between Dominating Sets in the TAR-Model |
Bousquet, Nicolas et al. |
2020 |
| 9 |
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping |
Bartier, Valentin et al. |
2020 |
| 10 |
Reconfiguration of Spanning Trees with Many or Few Leaves |
Bousquet, Nicolas et al. |
2020 |
| 11 |
Linear Transformations Between Colorings in Chordal Graphs |
Bousquet, Nicolas et al. |
2019 |
| 12 |
Parameterized Complexity of Independent Set in H-Free Graphs |
Bonnet, Édouard et al. |
2019 |
| 13 |
The Perfect Matching Reconfiguration Problem |
Bonamy, Marthe et al. |
2019 |
| 14 |
When Maximum Stable Set Can Be Solved in FPT Time |
Bonnet, Édouard et al. |
2019 |
| 15 |
Graph coloring, communication complexity and the stubborn problem (Invited talk) |
Bousquet, Nicolas et al. |
2013 |
| 16 |
A Polynomial Kernel for Multicut in Trees |
Bousquet, Nicolas et al. |
2009 |
