Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Vertex cover
Choose Problem

Authors: all
Choose Author


[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)

[29]
Amer E. Mouawad, Naomi Nishimura and Venkatesh Raman,
Vertex cover reconfiguration and beyond,
Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science 8889, pp. 452-463, 2014. (LINK)

[30]
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman and Marcin Wrochna,
Reconfiguration over tree decompositions,
Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), Lecture Notes in Computer Science 8894, pp. 246-257, 2014. (LINK)

[52]
Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,
Reconfiguration of vertex covers in a graph,
IEICE Transactions on Information and Systems E99-D(3), pp. 598-606, 2016. (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)