Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Christoph Damerius, Dominik Kaaser, Peter Kling, and Florian Schneider. On Greedily Packing Anchored Rectangles. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 61:1-61:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{damerius_et_al:LIPIcs.ICALP.2021.61, author = {Damerius, Christoph and Kaaser, Dominik and Kling, Peter and Schneider, Florian}, title = {{On Greedily Packing Anchored Rectangles}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {61:1--61:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.61}, URN = {urn:nbn:de:0030-drops-141306}, doi = {10.4230/LIPIcs.ICALP.2021.61}, annote = {Keywords: lower-left anchored rectangle packing, greedy algorithm, charging scheme} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Ke Chen and Adrian Dumitrescu. Multiparty Selection. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 42:1-42:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2020.42, author = {Chen, Ke and Dumitrescu, Adrian}, title = {{Multiparty Selection}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {42:1--42:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.42}, URN = {urn:nbn:de:0030-drops-133867}, doi = {10.4230/LIPIcs.ISAAC.2020.42}, annote = {Keywords: approximate selection, mediocre element, comparison algorithm, i-th order statistic, tournaments, quantiles, communication complexity} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth. Sparse Hop Spanners for Unit Disk Graphs. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 57:1-57:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dumitrescu_et_al:LIPIcs.ISAAC.2020.57, author = {Dumitrescu, Adrian and Ghosh, Anirban and T\'{o}th, Csaba D.}, title = {{Sparse Hop Spanners for Unit Disk Graphs}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {57:1--57:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.57}, URN = {urn:nbn:de:0030-drops-134018}, doi = {10.4230/LIPIcs.ISAAC.2020.57}, annote = {Keywords: graph approximation, \epsilon-net, hop-spanner, unit disk graph, lower bound} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, and Csaba D. Tóth. On the Stretch Factor of Polygonal Chains. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 56:1-56:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.MFCS.2019.56, author = {Chen, Ke and Dumitrescu, Adrian and Mulzer, Wolfgang and T\'{o}th, Csaba D.}, title = {{On the Stretch Factor of Polygonal Chains}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.56}, URN = {urn:nbn:de:0030-drops-110005}, doi = {10.4230/LIPIcs.MFCS.2019.56}, annote = {Keywords: polygonal chain, vertex dilation, Koch curve, recursive construction} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, and Sander Verdonschot. Convex Polygons in Cartesian Products. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 22:1-22:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{decarufel_et_al:LIPIcs.SoCG.2019.22, author = {De Carufel, Jean-Lou and Dumitrescu, Adrian and Meulemans, Wouter and Ophelders, Tim and Pennarun, Claire and T\'{o}th, Csaba D. and Verdonschot, Sander}, title = {{Convex Polygons in Cartesian Products}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.22}, URN = {urn:nbn:de:0030-drops-104267}, doi = {10.4230/LIPIcs.SoCG.2019.22}, annote = {Keywords: Erd\H{o}s-Szekeres theorem, Cartesian product, convexity, polyhedron, recursive construction, approximation algorithm} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Adrian Dumitrescu. A Product Inequality for Extreme Distances. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 30:1-30:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{dumitrescu:LIPIcs.SoCG.2019.30, author = {Dumitrescu, Adrian}, title = {{A Product Inequality for Extreme Distances}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {30:1--30:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.30}, URN = {urn:nbn:de:0030-drops-104343}, doi = {10.4230/LIPIcs.SoCG.2019.30}, annote = {Keywords: Extreme distances, repeated distances} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Kevin Balas, Adrian Dumitrescu, and Csaba Tóth. Anchored Rectangle and Square Packings. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 13:1-13:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{balas_et_al:LIPIcs.SoCG.2016.13, author = {Balas, Kevin and Dumitrescu, Adrian and T\'{o}th, Csaba}, title = {{Anchored Rectangle and Square Packings}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {13:1--13:16}, 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.13}, URN = {urn:nbn:de:0030-drops-59054}, doi = {10.4230/LIPIcs.SoCG.2016.13}, annote = {Keywords: Rectangle packing, anchored rectangle, greedy algorithm, charging scheme, approximation algorithm.} }
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 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Adrian Dumitrescu, Andre Schulz, Adam Sheffer, and Csaba D. Toth. Bounds on the maximum multiplicity of some common geometric graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 637-648, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2011.637, author = {Dumitrescu, Adrian and Schulz, Andre and Sheffer, Adam and Toth, Csaba D.}, title = {{Bounds on the maximum multiplicity of some common geometric graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {637--648}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.637}, URN = {urn:nbn:de:0030-drops-30505}, doi = {10.4230/LIPIcs.STACS.2011.637}, annote = {Keywords: combinatorial geometry, matching, triangulation, spanning tree, spanning cycle, weighted structure, non-crossing condition} }
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} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Adrian Dumitrescu and Csaba D. Tóth. Long Non-crossing Configurations in the Plane. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 311-322, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2010.2465, author = {Dumitrescu, Adrian and T\'{o}th, Csaba D.}, title = {{Long Non-crossing Configurations in the Plane}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {311--322}, 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.2465}, URN = {urn:nbn:de:0030-drops-24655}, doi = {10.4230/LIPIcs.STACS.2010.2465}, annote = {Keywords: Longest non-crossing Hamiltonian path, longest non-crossing Hamiltonian cycle, longest non-crossing spanning tree, approximation algorithm.} }
Feedback for Dagstuhl Publishing