Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Erik D. Demaine
Choose Author


[1]
Robert A. Hearn and Erik D. Demaine,
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation,
Theoretical Computer Science 343(1-2), pp. 72-96, 2005. (LINK)

[11]
Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno,
On the complexity of reconfiguration problems,
Theoretical Computer Science 412(12-14), pp. 1054-1065, 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)

[26]
Takehiro Ito and Erik D. Demaine,
Approximability of the subset sum reconfiguration problem,
Journal of Combinatorial Optimization 28(3), pp. 639-654, 2014. (LINK)

[34]
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada,
Linear-time algorithm for sliding tokens on trees,
Theoretical Computer Science 600, pp. 132-142, 2015. (LINK)