Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Independent set
Choose Problem

Authors: Amer E. Mouawad
Choose Author


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

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

[64]
Daniel Lokshtanov and Amer E. Mouawad,
The complexity of independent set reconfiguration on bipartite graphs,
arXiv 1707.02638, 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)