Paper by Erik D. Demaine
- 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.
- The abstract is 2 pages.
- 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)
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated September 17, 2018 by