Paper by Erik D. Demaine

Reference:

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, and Anak Yodpinyanee, “Even 1 × n Edge Matching and Jigsaw Puzzles are Really Hard”, in Abstracts from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016), Tokyo, Japan, September 2–4, 2016, to appear.

BibTeX

@InProceedings{Jigsaw1xn_JCDCGGG2016,
  AUTHOR        = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Adam Hesterberg and Pasin Manurangsi and Anak Yodpinyanee},
  TITLE         = {Even $1 \times n$ Edge Matching and Jigsaw Puzzles are Really Hard},
  BOOKTITLE     = {Abstracts from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016)},
  bookurl       = {http://www.jcdcgg.u-tokai.ac.jp/e.html},
  ADDRESS       = {Tokyo, Japan},
  MONTH         = {September 2--4},
  YEAR          = 2016,
  PAGES         = {to appear},

  length        = {2 pages},
  withstudent   = 1,
  unrefereed    = 1,
  paperkind     = {abstract},
  papers        = {Jigsaw1xn_JIP},
}

Length:

The abstract is 2 pages.

Availability:

The abstract is available in PDF (187k).

See information on file formats.

[Google Scholar search]

Related papers:

Jigsaw1xn_JIP (Even 1 × n Edge Matching and Jigsaw Puzzles are Really Hard)