# Paper by Martin L. Demaine

Reference:
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.

Length:
The abstract is 2 pages.

Availability:
Currently unavailable. If you are in a rush for copies, contact me.