Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Adrian Dumitrescu and Minghui Jiang. On the Number of Maximum Empty Boxes Amidst n Points. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 36:1-36:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@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.} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth. Computing Opaque Interior Barriers à la Shermer. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 128-143, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{dumitrescu_et_al:LIPIcs.APPROX-RANDOM.2014.128, author = {Dumitrescu, Adrian and Jiang, Minghui and T\'{o}th, Csaba D.}, title = {{Computing Opaque Interior Barriers \`{a} la Shermer}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {128--143}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.128}, URN = {urn:nbn:de:0030-drops-46938}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.128}, annote = {Keywords: Opaque barrier, approximation algorithm, isoperimetric inequality} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Adrian Dumitrescu and Minghui Jiang. Dispersion in Unit Disks. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 299-310, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2010.2464, author = {Dumitrescu, Adrian and Jiang, Minghui}, title = {{Dispersion in Unit Disks}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {299--310}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2464}, URN = {urn:nbn:de:0030-drops-24646}, doi = {10.4230/LIPIcs.STACS.2010.2464}, annote = {Keywords: Dispersion problem, linear programming, approximation algorithm} }
Feedback for Dagstuhl Publishing