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)

[14]
Takehiro Ito, Marcin Kamiński and Erik D. Demaine,
Reconfiguration of list edge-colorings in a graph,
Discrete Applied Mathematics 160(15), pp. 2199-2207, 2012. (LINK)

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

[26]
Takehiro Ito and Erik D. Demaine,
Approximability of the subset sum reconfiguration problem,
Journal of Combinatorial Optimization 28(3), pp. 639-654, 2014. (LINK)

[27]
Takehiro Ito, Marcin Kamiński and Hirotaka Ono,
Fixed-parameter tractability of token jumping on planar graphs,
Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science 8889, pp. 208-219, 2014. (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)

[34]
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada,
Linear-time algorithm for sliding tokens on trees,
Theoretical Computer Science 600, pp. 132-142, 2015. (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)

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

[50]
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal,
The complexity of dominating set reconfiguration,
Theoretical Computer Science 651, pp. 37-49, 2016. (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)

[63]
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
Reconfiguration of maximum-weight b-matchings in a graph,
Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), Lecture Notes in Computer Science 10392, pp. 287-296, 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)