| No. |
Title |
Author |
Year |
| 1 |
Linear Transformations Between Dominating Sets in the TAR-Model |
Bousquet, Nicolas et al. |
2020 |
| 2 |
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping |
Bartier, Valentin et al. |
2020 |
| 3 |
Reconfiguration of Spanning Trees with Many or Few Leaves |
Bousquet, Nicolas et al. |
2020 |
| 4 |
Linear Transformations Between Colorings in Chordal Graphs |
Bousquet, Nicolas et al. |
2019 |
| 5 |
Parameterized Complexity of Independent Set in H-Free Graphs |
Bonnet, Édouard et al. |
2019 |
| 6 |
The Perfect Matching Reconfiguration Problem |
Bonamy, Marthe et al. |
2019 |
| 7 |
When Maximum Stable Set Can Be Solved in FPT Time |
Bonnet, Édouard et al. |
2019 |
| 8 |
Graph coloring, communication complexity and the stubborn problem (Invited talk) |
Bousquet, Nicolas et al. |
2013 |
| 9 |
A Polynomial Kernel for Multicut in Trees |
Bousquet, Nicolas et al. |
2009 |
