Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:


[11]
Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno,
On the complexity of reconfiguration problems,
Theoretical Computer Science 412(12-14), pp. 1054-1065, 2011. (LINK)

[37]
Takehiro Ito, Hirotaka Ono and Yota Otachi,
Reconfiguration of cliques in a graph,
Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015), Lecture Notes in Computer Science 9076, pp. 212-223, 2015. (LINK)

[67]
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour and Akira Suzuki,
On the parameterized complexity of reconfiguration problems,
Algorithmica 78(1), pp. 274-297, 2017. (LINK)