Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, and Arne Schmidt. Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 62:1-62:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{becker_et_al:LIPIcs.SoCG.2021.62, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Konitzny, Matthias and Morr, Sebastian and Schmidt, Arne}, title = {{Can You Walk This? Eulerian Tours and IDEA Instructions}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {62:1--62:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.62}, URN = {urn:nbn:de:0030-drops-138616}, doi = {10.4230/LIPIcs.SoCG.2021.62}, annote = {Keywords: Eulerian tours, algorithms, education, IDEA instructions} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, and Sahil Shah. Worst-Case Optimal Covering of Rectangles by Disks. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 42:1-42:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.42, author = {Fekete, S\'{a}ndor P. and Gupta, Utkarsh and Keldenich, Phillip and Scheffer, Christian and Shah, Sahil}, title = {{Worst-Case Optimal Covering of Rectangles by Disks}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {42:1--42:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.42}, URN = {urn:nbn:de:0030-drops-122003}, doi = {10.4230/LIPIcs.SoCG.2020.42}, annote = {Keywords: Disk covering, critical density, covering coefficient, tight worst-case bound, interval arithmetic, approximation} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Sándor P. Fekete, Phillip Keldenich, and Christian Scheffer. Covering Rectangles by Disks: The Video (Media Exposition). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 75:1-75:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.75, author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Scheffer, Christian}, title = {{Covering Rectangles by Disks: The Video}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {75:1--75:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.75}, URN = {urn:nbn:de:0030-drops-122337}, doi = {10.4230/LIPIcs.SoCG.2020.75}, annote = {Keywords: Disk covering, critical density, covering coefficient, tight worst-case bound, interval arithmetic, approximation} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Sándor P. Fekete, Phillip Keldenich, and Christian Scheffer. Packing Disks into Disks with Optimal Worst-Case Density. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 35:1-35:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2019.35, author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Scheffer, Christian}, title = {{Packing Disks into Disks with Optimal Worst-Case Density}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {35:1--35:19}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.35}, URN = {urn:nbn:de:0030-drops-104398}, doi = {10.4230/LIPIcs.SoCG.2019.35}, annote = {Keywords: Disk packing, packing density, tight worst-case bound, interval arithmetic, approximation} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, and Christian Scheffer. Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 63:1-63:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{becker_et_al:LIPIcs.SoCG.2019.63, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Keldenich, Phillip and Morr, Sebastian and Scheffer, Christian}, title = {{Packing Geometric Objects with Optimal Worst-Case Density}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {63:1--63:6}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.63}, URN = {urn:nbn:de:0030-drops-104678}, doi = {10.4230/LIPIcs.SoCG.2019.63}, annote = {Keywords: Packing, complexity, bounds, packing density} }
Feedback for Dagstuhl Publishing