Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Christos H. Papadimitriou
Choose Author


[6]
Parikshit Gopalan, Phokion G. Kolaitis, Elitza Maneva and Christos H. Papadimitriou,
The connectivity of Boolean satisfiability: computational and structural dichotomies,
SIAM Journal on Computing 38(6), pp. 2330-2355, 2009. (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)