1. Reoptimization of Parameterized Problems;Böckenhauer,2018
2. A linear time algorithm for finding tree-decompositions of small treewidth;Bodlaender;Proceedings of the twentyfifth annual ACM symposium on Theory of computing,1993
3. Recoloring bounded treewidth graphs;Bonamy;Electronic Notes in Discrete Mathematics,2013
4. Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs;Bonamy;Journal of Combinatorial Optimization,2012
5. Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances;Bonsma,2007