Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, and Andrew Winslow, “Packing Cube Nets into Rectangles with O(1) Holes”, in Revised Papers from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018), edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, and Yushi Uno, Lecture Notes in Computer Science, volume 13034, Quezon City, Philippines, September 1–3, 2018, pages 152–164, Springer.

BibTeX

@InProceedings{CubeNet_JCDCGGG2018full,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Ryuhei Uehara and Yushi Uno and Andrew Winslow},
  TITLE         = {Packing Cube Nets into Rectangles with {$O(1)$} Holes},
  BOOKTITLE     = {Revised Papers from the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018)},
  SERIES        = {Lecture Notes in Computer Science},
  seriesurl     = {http://www.springer.de/comp/lncs/},
  EDITOR        = {Jin Akiyama and Reginaldo M. Marcelo and Mari{-}Jo P. Ruiz and Yushi Uno},
  ADDRESS       = {Quezon City, Philippines},
  MONTH         = {September 1--3},
  YEAR          = 2018,
  VOLUME        = 13034,
  PAGES         = {152--164},
  PUBLISHER     = {Springer},

  replaces      = {CubeNet_JCDCGGG2018},
  papers        = {CubeNet_JCDCGGG2018},
  doi           = {https://dx.doi.org/10.1007/978-3-030-90048-9_12},
  dblp          = {https://dblp.org/rec/conf/jcdcg/DemaineDUUW18},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1007/978-3-030-90048-9_12">SpringerLink</A>.},
}

Comments:

This paper is also available from SpringerLink.

Availability:

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

[Google Scholar search]

Related papers:

CubeNet_JCDCGGG2018 (How Efficiently Can Nets of Polycubes Pack a Rectangle?)