Paper by Erik D. Demaine

Reference:

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, and Justin Kopinsky, “Path Puzzles: Discrete Tomography with a Path Constraint is Hard”, in Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2017), Tokyo, Japan, August 29–September 1, 2017, pages 102–103.

BibTeX

@InProceedings{PathPuzzles_JCDCGGG2017,
  AUTHOR        = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Adam Hesterberg and Roderick Kimball and Justin Kopinsky},
  TITLE         = {Path Puzzles: Discrete Tomography with a Path Constraint is Hard},
  BOOKTITLE     = {Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2017)},
  bookurl       = {http://www.jcdcgg.u-tokai.ac.jp/},
  ADDRESS       = {Tokyo, Japan},
  MONTH         = {August 29--September 1},
  YEAR          = 2017,
  PAGES         = {102--103},

  length        = {2 pages},
  withstudent   = 1,
  paperkind     = {abstract},
  unrefereed    = 1,
  papers        = {PathPuzzles_GC},
  webpages      = {fonts/pathpuzzles},
}

Length:

The abstract is 2 pages.

Availability:

The abstract is available in PDF (270k).

See information on file formats.

[Google Scholar search]

Related papers:

PathPuzzles_GC (Path Puzzles: Discrete Tomography with a Path Constraint is Hard)

Related webpages:

Path Puzzles Font