Strongly NP-complete

Results: 18



#Item
1CCCG 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†

Add to Reading List

Source URL: zacharyabel.com

Language: English - Date: 2017-07-06 00:58:59
    2An 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

    Add to Reading List

    Source URL: community.dur.ac.uk

    Language: English - Date: 2008-11-30 14:19:38
    3Algorithmica: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 ·

    Add to Reading List

    Source URL: community.dur.ac.uk

    Language: English - Date: 2011-12-14 14:10:08
    4Packing Squares into a Square is Strongly NP-complete 𝑥𝑥 𝑥𝑥 𝐵𝐵 + 𝑎𝑎𝑖𝑖

    Packing Squares into a Square is Strongly NP-complete 𝑥𝑥 𝑥𝑥 𝐵𝐵 + 𝑎𝑎𝑖𝑖

    Add to Reading List

    Source URL: courses.csail.mit.edu

    Language: English - Date: 2014-10-14 11:01:11
      5Simple 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‡

      Add to Reading List

      Source URL: fwcg14.cse.uconn.edu

      Language: English - Date: 2014-11-05 17:17:51
        6Edge-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

        Add to Reading List

        Source URL: zacharyabel.com

        - Date: 2016-01-24 17:37:25
          7Partial 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

          Add to Reading List

          Source URL: giovanniviglietta.com

          Language: English - Date: 2013-05-16 16:45:32
            8Edge-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

            Add to Reading List

            Source URL: zacharyabel.com

            Language: English - Date: 2016-01-24 17:37:25
              9CCCG 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†

              Add to Reading List

              Source URL: 2011.cccg.ca

              Language: English - Date: 2011-08-06 04:11:14
              10CCCG 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†

              Add to Reading List

              Source URL: www.cccg.ca

              Language: English - Date: 2011-08-06 04:11:14