Paper by Martin L. Demaine

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.

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

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

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