@InProceedings{dumitrescu_et_al:LIPIcs.SoCG.2016.36,
  author =	{Dumitrescu, Adrian and Jiang, Minghui},
  title =	{{On the Number of Maximum Empty Boxes Amidst n Points}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{36:1--36:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-009-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{51},
  editor =	{Fekete, S\'{a}ndor and Lubiw, Anna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.36},
  URN =		{urn:nbn:de:0030-drops-59281},
  doi =		{10.4230/LIPIcs.SoCG.2016.36},
  annote =	{Keywords: Maximum empty box, Davenport-Schinzel sequence, approximation algorithm, data mining.}
}