Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Paul S. Bonsma
Choose Author


[4]
Paul S. Bonsma and Luis Cereceda,
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances,
Theoretical Computer Science 410(50), pp. 5215-5226, 2009. (LINK)

[19]
Paul S. Bonsma,
The complexity of rerouting shortest paths,
Theoretical Computer Science 510, pp. 1-12, 2013. (LINK)

[24]
Paul S. Bonsma, Marcin Kamiński and Marcin Wrochna,
Reconfiguring independent sets in claw-free graphs,
Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014), Lecture Notes in Computer Science 8503, pp. 86-97, 2014. (LINK)

[25]
Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura and Venkatesh Raman,
The complexity of bounded length graph recoloring and CSP reconfiguration,
Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), Lecture Notes in Computer Science 8894, pp. 110-121, 2014. (LINK)

[45]
Paul S. Bonsma,
Independent set reconfiguration in cographs and their generalizations,
Journal of Graph Theory 83(2), pp. 164-195, 2016. (LINK)

[46]
Paul S. Bonsma and Daniël Paulusma,
Using contracted solution graphs for solving reconfiguration problems,
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Leibniz International Proceedings in Informatics 58, pp. 20:01-20:15, 2016. (LINK)

[56]
Paul S. Bonsma,
Rerouting shortest paths in planar graphs,
Discrete Applied Mathematics 231, pp. 95-112, 2017. (LINK)