Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Yota Otachi
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)

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

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