Go to the corresponding LIPIcs Volume Portal 
Dumitrescu, Adrian ; Jiang, Minghui
pdfformat: 

@InProceedings{dumitrescu_et_al:LIPIcs:2016:5928, author = {Adrian Dumitrescu and Minghui Jiang}, title = {{On the Number of Maximum Empty Boxes Amidst n Points}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {36:136:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770095}, ISSN = {18688969}, year = {2016}, volume = {51}, editor = {S{\'a}ndor Fekete and Anna Lubiw}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5928}, URN = {urn:nbn:de:0030drops59281}, doi = {10.4230/LIPIcs.SoCG.2016.36}, annote = {Keywords: Maximum empty box, DavenportSchinzel sequence, approximation algorithm, data mining.} }
Keywords:  Maximum empty box, DavenportSchinzel sequence, approximation algorithm, data mining.  
Seminar:  32nd International Symposium on Computational Geometry (SoCG 2016)  
Issue Date:  2016  
Date of publication:  09.06.2016 