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)

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

[35]
Eli Fox-Epstein, Duc A. Hoang, Yota Otachi and Ryuhei Uehara,
Sliding token on bipartite permutation graphs,
Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science 9472, pp. 237-247, 2015. (LINK)

[51]
Duc A. Hoang and Ryuhei Uehara,
Sliding tokens on a cactus,
Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), Leibniz International Proceedings in Informatics 64, pp. 37:1-37:26, 2016. (LINK)

[55]
Takeshi Yamada and Ryuhei Uehara,
Shortest reconfiguration of sliding tokens on a caterpillar,
Proceedings of the 10th International Workshop on Algorithms and Computation (WALCOM 2016), Lecture Notes in Computer Science 9627, pp. 236-248, 2016. (LINK)

[61]
Duc A. Hoang, Eli Fox-Epstein and Ryuhei Uehara,
Sliding tokens on block graphs,
Proceedings of the 11th International Workshop on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science 10167, pp. 460-471, 2017. (LINK)

[62]
Duc A. Hoang and Ryuhei Uehara,
Polynomial-time algorithms for sliding tokens on cactus graphs and block graphs,
arXiv 1705.00429, 2017. (LINK)