Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Akira Suzuki
Choose Author


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

[53]
Akira Suzuki, Amer E. Mouawad and Naomi Nishimura,
Reconfiguration of dominating sets,
Journal of Combinatorial Optimization 32(4), pp. 1182-1195, 2016. (LINK)

[67]
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour and Akira Suzuki,
On the parameterized complexity of reconfiguration problems,
Algorithmica 78(1), pp. 274-297, 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)