| No. |
Title |
Author |
Year |
| 1 |
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters |
Bodlaender, Hans L. et al. |
2023 |
| 2 |
List Colouring Trees in Logarithmic Space |
Bodlaender, Hans L. et al. |
2022 |
| 3 |
On the Complexity of Problems on Tree-Structured Graphs |
Bodlaender, Hans L. et al. |
2022 |
| 4 |
On the Parameterized Complexity of Computing Tree-Partitions |
Bodlaender, Hans L. et al. |
2022 |
| 5 |
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth |
Groenland, Carla et al. |
2022 |
| 6 |
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure |
Bodlaender, Hans L. et al. |
2022 |
| 7 |
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs |
Bonamy, Marthe et al. |
2021 |
| 8 |
Parameterized Complexities of Dominating and Independent Set Reconfiguration |
Bodlaender, Hans L. et al. |
2021 |
