Paper by Erik D. Demaine

Reference:

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, and Anak Yodpinyanee, “k-piece dissection is NP-hard”, in Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Kyoto, Japan, September 14–16, 2015, to appear.

BibTeX

@InProceedings{Dissection_JCDCGG2015,
  AUTHOR        = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Jayson Lynch and Pasin Manurangsi and Mikhail Rudoy and Anak Yodpinyanee},
  TITLE         = {$k$-piece dissection is {NP}-hard},
  BOOKTITLE     = {Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015)},
  bookurl       = {http://www.kurims.kyoto-u.ac.jp/~takazawa/JCDCGG2015/},
  ADDRESS       = {Kyoto, Japan},
  MONTH         = {September 14--16},
  YEAR          = 2015,
  PAGES         = {to appear},

  unrefereed    = 1,
  paperkind     = {abstract},
  withstudent   = 1,
  papers        = {Dissection_JCDCGG2015full},
}

Availability:

The abstract is available in PDF (149k).

See information on file formats.

[Google Scholar search]

Related papers:

Dissection_JCDCGG2015full (Dissection with the Fewest Pieces is Hard, Even to Approximate)