Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:


[15]
Takehiro Ito, Kazuto Kawamura and Xiao Zhou,
An improved sufficient condition for reconfiguration of list edge-colorings in a tree,
IEICE Transactions on Information and Systems E95-D(3), pp. 737-745, 2012. (LINK)

[28]
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou,
Reconfiguration of list L(2,1)-labelings in a graph,
Theoretical Computer Science 544, pp. 84-97, 2014. (LINK)

[36]
Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
The list coloring reconfiguration problem for bounded pathwidth graphs,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98-A(6), pp. 1168-1178, 2015. (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)

[60]
Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Parameterized complexity of the list coloring reconfiguration problem with graph parameters,
arXiv 1705.07551, 2017. (LINK)

[65]
Haruka Mizuta, Takehiro Ito and Xiao Zhou,
Reconfiguration of Steiner trees in an unweighted graph,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100-A(7), pp. 1532-1540, 2017. (LINK)

[68]
Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
The complexity of (list) edge-coloring reconfiguration problem,
Proceedings of the 11th International Workshop on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science 10167, pp. 347-358, 2017. (LINK)