Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Naomi Nishimura
Choose Author


[25]
Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura and Venkatesh Raman,
The complexity of bounded length graph recoloring and CSP reconfiguration,
Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), Lecture Notes in Computer Science 8894, pp. 110-121, 2014. (LINK)

[29]
Amer E. Mouawad, Naomi Nishimura and Venkatesh Raman,
Vertex cover reconfiguration and beyond,
Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science 8889, pp. 452-463, 2014. (LINK)

[30]
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman and Marcin Wrochna,
Reconfiguration over tree decompositions,
Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), Lecture Notes in Computer Science 8894, pp. 246-257, 2014. (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)

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

[66]
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak and Venkatesh Raman,
Shortest reconfiguration paths in the solution space of Boolean formulas,
SIAM Journal on Discrete Mathematics 31(3), pp. 2185-2200, 2017. (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)