Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Marcin Kamiński
Choose Author


[12]
Marcin Kamiński, Paul Medvedev and Martin Milanič,
Shortest paths between shortest paths,
Theoretical Computer Science 412(39), pp. 5205-5210, 2011. (LINK)

[14]
Takehiro Ito, Marcin Kamiński and Erik D. Demaine,
Reconfiguration of list edge-colorings in a graph,
Discrete Applied Mathematics 160(15), pp. 2199-2207, 2012. (LINK)

[16]
Marcin Kamiński, Paul Medvedev and Martin Milanič,
Complexity of independent set reconfigurability problems,
Theoretical Computer Science 439, pp. 9-15, 2012. (LINK)

[24]
Paul S. Bonsma, Marcin Kamiński and Marcin Wrochna,
Reconfiguring independent sets in claw-free graphs,
Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014), Lecture Notes in Computer Science 8503, pp. 86-97, 2014. (LINK)

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