Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Takeshi Yamada
Choose Author


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

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