Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Dominating set
Choose Problem

Authors: all
Choose Author


[38]
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan and Saket Saurabh,
Reconfiguration on sparse graphs,
Proceedings of the 14th International Symposium on Algorithms and Data Structures (WADS 2015), Lecture Notes in Computer Science 9214, pp. 506-517, 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)

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