1![CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine† CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†](https://www.pdfsearch.io/img/7f280b0717bbab6a995e4dcf9e71cbd9.jpg) | Add to Reading ListSource URL: zacharyabel.comLanguage: English - Date: 2017-07-06 00:58:59
|
---|
2![An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de](https://www.pdfsearch.io/img/f2c863270aea4ed15e420a3d3411d201.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2008-11-30 14:19:38
|
---|
3![Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios · Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios ·](https://www.pdfsearch.io/img/65abf656b7a95699c7606b0527b4b17f.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2011-12-14 14:10:08
|
---|
4![Packing Squares into a Square is Strongly NP-complete 𝑥𝑥 𝑥𝑥 𝐵𝐵 + 𝑎𝑎𝑖𝑖 Packing Squares into a Square is Strongly NP-complete 𝑥𝑥 𝑥𝑥 𝐵𝐵 + 𝑎𝑎𝑖𝑖](https://www.pdfsearch.io/img/0f35752f7347a0f5320bc59fdb6add99.jpg) | Add to Reading ListSource URL: courses.csail.mit.eduLanguage: English - Date: 2014-10-14 11:01:11
|
---|
5![Simple Folding is Strongly NP-Complete Hugo A. Akitaya∗ Erik D. Demaine† Jason S. Ku‡ Simple Folding is Strongly NP-Complete Hugo A. Akitaya∗ Erik D. Demaine† Jason S. Ku‡](https://www.pdfsearch.io/img/997a3ddf140f28c0ed0f16d77384faeb.jpg) | Add to Reading ListSource URL: fwcg14.cse.uconn.eduLanguage: English - Date: 2014-11-05 17:17:51
|
---|
6![Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011
Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011](https://www.pdfsearch.io/img/95bade39f26e5e6195138b0e753359f7.jpg) | Add to Reading ListSource URL: zacharyabel.com- Date: 2016-01-24 17:37:25
|
---|
7![Partial Searchlight Scheduling is Strongly PSPACE-complete Giovanni Viglietta∗ in 2-EXP. Whether SSP is NP-hard or even in NP is left in [2] as an open problem. More recently, in [4], the author introduced the Partial Searchlight Scheduling is Strongly PSPACE-complete Giovanni Viglietta∗ in 2-EXP. Whether SSP is NP-hard or even in NP is left in [2] as an open problem. More recently, in [4], the author introduced the](https://www.pdfsearch.io/img/b74f66e421954a74499bf7aaafa46c60.jpg) | Add to Reading ListSource URL: giovanniviglietta.comLanguage: English - Date: 2013-05-16 16:45:32
|
---|
8![Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel1 1 MIT Erik D. Demaine2 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel1 1 MIT Erik D. Demaine2](https://www.pdfsearch.io/img/f1a03ad0411e828086555aff8899e2f2.jpg) | Add to Reading ListSource URL: zacharyabel.comLanguage: English - Date: 2016-01-24 17:37:25
|
---|
9![CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine† CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†](https://www.pdfsearch.io/img/0c59ce643841a8f0e899c80959e2ffaa.jpg) | Add to Reading ListSource URL: 2011.cccg.caLanguage: English - Date: 2011-08-06 04:11:14
|
---|
10![CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine† CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†](https://www.pdfsearch.io/img/9445f4e8a440a8acdf1c3aa5e273d5a5.jpg) | Add to Reading ListSource URL: www.cccg.caLanguage: English - Date: 2011-08-06 04:11:14
|
---|