Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, and Andrew Winslow, “How Efficiently Can Nets of Polycubes Pack a Rectangle?”, in Abstracts from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), Manila, Philippines, September 1–3, 2018, to appear.

BibTeX

@InProceedings{CubeNet_JCDCGGG2018,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Ryuhei Uehara and Yushi Uno and Andrew Winslow},
  TITLE         = {How Efficiently Can Nets of Polycubes Pack a Rectangle?},
  BOOKTITLE     = {Abstracts from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018)},
  bookurl       = {https://ateneo.edu/ls/sose/mathematics/jcdcggg2018},
  ADDRESS       = {Manila, Philippines},
  MONTH         = {September 1--3},
  YEAR          = 2018,
  PAGES         = {to appear},

  length        = {2 pages},
  paperkind     = {abstract},
  unrefereed    = 1,
  papers        = {CubeNet_JCDCGGG2018full},
}

Length:

The abstract is 2 pages.

Availability:

The abstract is available in PDF (80k).

See information on file formats.

[Google Scholar search]

Related papers:

CubeNet_JCDCGGG2018full (Packing Cube Nets into Rectangles with O(1) Holes)