Paper by Martin L. Demaine

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, and Anak Yodpinyanee, “Even $1 \times 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.

The abstract is 2 pages.

Currently unavailable. If you are in a rush for copies, contact me.
[Google Scholar search]

See also other papers by Martin Demaine.
These pages are generated automagically from a BibTeX file.
Last updated December 13, 2016 by Martin Demaine.