Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Hirotaka Ono
Choose Author


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

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