More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete."

Zachary Abel, Erik D. Demaine (2011)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ cccg.ca (open access)
- export record
  dblp key:
  - conf/cccg/AbelD11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/AbelD11
Zachary Abel, Erik D. Demaine:
Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. CCCG 2011

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.