Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete

Zachary Abel, Erik D. Demaine. Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. In Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011. 2011. [doi]

@inproceedings{AbelD11,
  title = {Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete},
  author = {Zachary Abel and Erik D. Demaine},
  year = {2011},
  url = {http://www.cccg.ca/proceedings/2011/papers/paper43.pdf},
  researchr = {https://researchr.org/publication/AbelD11},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
}