Paper by Erik D. Demaine

Reference:

Erik D. Demaine and Martin L. Demaine, “Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity”, in Abstracts from the Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT 2007), Kyoto, Japan, June 11–15, 2007.

BibTeX

@InProceedings{Jigsaw_KyotoCGGT2007,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine},
  TITLE         = {Jigsaw Puzzles, Edge Matching, and Polyomino Packing:
                   Connections and Complexity},
  BOOKTITLE     = {Abstracts from the Kyoto International Conference on
                   Computational Geometry and Graph Theory (KyotoCGGT 2007)},
  bookurl       = {http://gorogoro.cis.ibaraki.ac.jp/web/cggt2007/},
  ADDRESS       = {Kyoto, Japan},
  MONTH         = {June 11--15},
  YEAR          = 2007,

  info          = {book has no page numbers!},
  paperkind     = {abstract},
  length        = {2 pages},
  unrefereed    = 1,
  papers        = {Jigsaw_GC},
}

Length:

The abstract is 2 pages.

Availability:

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

[Google Scholar search]

Related papers:

Jigsaw_GC (Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity)