38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 1-1110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{goaoc_et_al:LIPIcs.SoCG.2022, title = {{LIPIcs, Volume 224, SoCG 2022, Complete Volume}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {1--1110}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022}, URN = {urn:nbn:de:0030-drops-160075}, doi = {10.4230/LIPIcs.SoCG.2022}, annote = {Keywords: LIPIcs, Volume 224, SoCG 2022, Complete Volume} }
38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{goaoc_et_al:LIPIcs.SoCG.2022.0, author = {Goaoc, Xavier and Kerber, Michael}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.0}, URN = {urn:nbn:de:0030-drops-160087}, doi = {10.4230/LIPIcs.SoCG.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Anders Aamand, Mikkel Abrahamsen, Thomas Ahle, and Peter M. R. Rasmussen. Tiling with Squares and Packing Dominos in Polynomial Time. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 1:1-1:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aamand_et_al:LIPIcs.SoCG.2022.1, author = {Aamand, Anders and Abrahamsen, Mikkel and Ahle, Thomas and Rasmussen, Peter M. R.}, title = {{Tiling with Squares and Packing Dominos in Polynomial Time}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {1:1--1:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.1}, URN = {urn:nbn:de:0030-drops-160096}, doi = {10.4230/LIPIcs.SoCG.2022.1}, annote = {Keywords: packing, tiling, polyominos} }
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, and Hao-Tsung Yang. On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2022.2, author = {Afshani, Peyman and de Berg, Mark and Buchin, Kevin and Gao, Jie and L\"{o}ffler, Maarten and Nayyeri, Amir and Raichel, Benjamin and Sarkar, Rik and Wang, Haotian and Yang, Hao-Tsung}, title = {{On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.2}, URN = {urn:nbn:de:0030-drops-160109}, doi = {10.4230/LIPIcs.SoCG.2022.2}, annote = {Keywords: Approximation, Motion Planning, Scheduling} }
Peyman Afshani and Pingan Cheng. On Semialgebraic Range Reporting. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2022.3, author = {Afshani, Peyman and Cheng, Pingan}, title = {{On Semialgebraic Range Reporting}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.3}, URN = {urn:nbn:de:0030-drops-160117}, doi = {10.4230/LIPIcs.SoCG.2022.3}, annote = {Keywords: Computational Geometry, Range Searching, Data Structures and Algorithms, Lower Bounds} }
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, and Micha Sharir. Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2022.4, author = {Agarwal, Pankaj K. and Aronov, Boris and Ezra, Esther and Katz, Matthew J. and Sharir, Micha}, title = {{Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.4}, URN = {urn:nbn:de:0030-drops-160126}, doi = {10.4230/LIPIcs.SoCG.2022.4}, annote = {Keywords: Intersection searching, Semi-algebraic range searching, Point-enclosure queries, Ray-shooting queries, Polynomial partitions, Cylindrical algebraic decomposition, Multi-level partition trees, Collision detection} }
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2022.5, author = {Aichholzer, Oswin and Garc{\'\i}a, Alfredo and Tejel, Javier and Vogtenhuber, Birgit and Weinberger, Alexandra}, title = {{Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.5}, URN = {urn:nbn:de:0030-drops-160136}, doi = {10.4230/LIPIcs.SoCG.2022.5}, annote = {Keywords: Simple drawings, simple topological graphs, disjoint edges, plane matching, plane path} }
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, and Birgit Vogtenhuber. Edge Partitions of Complete Geometric Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2022.6, author = {Aichholzer, Oswin and Obenaus, Johannes and Orthaber, Joachim and Paul, Rosna and Schnider, Patrick and Steiner, Raphael and Taubner, Tim and Vogtenhuber, Birgit}, title = {{Edge Partitions of Complete Geometric Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.6}, URN = {urn:nbn:de:0030-drops-160141}, doi = {10.4230/LIPIcs.SoCG.2022.6}, annote = {Keywords: edge partition, complete geometric graph, plane spanning tree, wheel set} }
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, and Heiko Röglin. Minimum-Error Triangulations for Sea Surface Reconstruction. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{arutyunova_et_al:LIPIcs.SoCG.2022.7, author = {Arutyunova, Anna and Driemel, Anne and Haunert, Jan-Henrik and Haverkort, Herman and Kusche, J\"{u}rgen and Langetepe, Elmar and Mayer, Philip and Mutzel, Petra and R\"{o}glin, Heiko}, title = {{Minimum-Error Triangulations for Sea Surface Reconstruction}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.7}, URN = {urn:nbn:de:0030-drops-160155}, doi = {10.4230/LIPIcs.SoCG.2022.7}, annote = {Keywords: Minimum-Error Triangulation, k-Order Delaunay Triangulations, Data dependent Triangulations, Sea Surface Reconstruction, fixed-Edge Graph} }
Dominique Attali and André Lieutier. Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm Minimization. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{attali_et_al:LIPIcs.SoCG.2022.8, author = {Attali, Dominique and Lieutier, Andr\'{e}}, title = {{Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm Minimization}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.8}, URN = {urn:nbn:de:0030-drops-160162}, doi = {10.4230/LIPIcs.SoCG.2022.8}, annote = {Keywords: manifold reconstruction, Delaunay complex, triangulation, sampling conditions, optimization, 𝓁₁-norm minimization, simplicial complex, chain, fundamental class} }
Håvard Bakke Bjerkevik. Tighter Bounds for Reconstruction from ε-Samples. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bakkebjerkevik:LIPIcs.SoCG.2022.9, author = {Bakke Bjerkevik, H\r{a}vard}, title = {{Tighter Bounds for Reconstruction from \epsilon-Samples}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.9}, URN = {urn:nbn:de:0030-drops-160170}, doi = {10.4230/LIPIcs.SoCG.2022.9}, annote = {Keywords: Curve reconstruction, surface reconstruction, \epsilon-sampling} }
Martin Balko, Manfred Scheucher, and Pavel Valtr. Erdős-Szekeres-Type Problems in the Real Projective Plane. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{balko_et_al:LIPIcs.SoCG.2022.10, author = {Balko, Martin and Scheucher, Manfred and Valtr, Pavel}, title = {{Erd\H{o}s-Szekeres-Type Problems in the Real Projective Plane}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.10}, URN = {urn:nbn:de:0030-drops-160182}, doi = {10.4230/LIPIcs.SoCG.2022.10}, annote = {Keywords: real projective plane, point set, convex position, k-gon, k-hole, Erd\H{o}s-Szekeres theorem, Horton set, random point set} }
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, and Jie Xue. True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2022.11, author = {Bandyapadhyay, Sayan and Lochet, William and Lokshtanov, Daniel and Saurabh, Saket and Xue, Jie}, title = {{True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.11}, URN = {urn:nbn:de:0030-drops-160190}, doi = {10.4230/LIPIcs.SoCG.2022.11}, annote = {Keywords: unit-disk graphs, tree decomposition, contraction decomposition, bipartization} }
Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, and Stijn Slot. Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{banyassady_et_al:LIPIcs.SoCG.2022.12, author = {Banyassady, Bahareh and de Berg, Mark and Bringmann, Karl and Buchin, Kevin and Fernau, Henning and Halperin, Dan and Kostitsyna, Irina and Okamoto, Yoshio and Slot, Stijn}, title = {{Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.12}, URN = {urn:nbn:de:0030-drops-160203}, doi = {10.4230/LIPIcs.SoCG.2022.12}, annote = {Keywords: motion planning, computational geometry, simple polygon} }
Yair Bartal, Ora Nova Fandina, and Kasper Green Larsen. Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bartal_et_al:LIPIcs.SoCG.2022.13, author = {Bartal, Yair and Fandina, Ora Nova and Larsen, Kasper Green}, title = {{Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.13}, URN = {urn:nbn:de:0030-drops-160219}, doi = {10.4230/LIPIcs.SoCG.2022.13}, annote = {Keywords: average distortion, practical dimensionality reduction, JL transform} }
Ulrich Bauer, Håvard Bakke Bjerkevik, and Benedikt Fluhr. Quasi-Universality of Reeb Graph Distances. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bauer_et_al:LIPIcs.SoCG.2022.14, author = {Bauer, Ulrich and Bjerkevik, H\r{a}vard Bakke and Fluhr, Benedikt}, title = {{Quasi-Universality of Reeb Graph Distances}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.14}, URN = {urn:nbn:de:0030-drops-160221}, doi = {10.4230/LIPIcs.SoCG.2022.14}, annote = {Keywords: Reeb graphs, contour trees, merge trees, distances, universality, interleaving distance, functional distortion distance, functional contortion distance} }
Ulrich Bauer and Fabian Roll. Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips Filtrations. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bauer_et_al:LIPIcs.SoCG.2022.15, author = {Bauer, Ulrich and Roll, Fabian}, title = {{Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips Filtrations}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.15}, URN = {urn:nbn:de:0030-drops-160237}, doi = {10.4230/LIPIcs.SoCG.2022.15}, annote = {Keywords: Vietoris–Rips complexes, persistent homology, discrete Morse theory, apparent pairs, hyperbolicity, geodesic defect, Ripser} }
Ahmad Biniaz. Acute Tours in the Plane. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 16:1-16:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{biniaz:LIPIcs.SoCG.2022.16, author = {Biniaz, Ahmad}, title = {{Acute Tours in the Plane}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {16:1--16:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.16}, URN = {urn:nbn:de:0030-drops-160240}, doi = {10.4230/LIPIcs.SoCG.2022.16}, annote = {Keywords: planar points, acute tour, Hamiltonian cycle, equitable partition} }
Mitchell Black, Nello Blaser, Amir Nayyeri, and Erlend Raa Vågset. ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{black_et_al:LIPIcs.SoCG.2022.17, author = {Black, Mitchell and Blaser, Nello and Nayyeri, Amir and V\r{a}gset, Erlend Raa}, title = {{ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.17}, URN = {urn:nbn:de:0030-drops-160253}, doi = {10.4230/LIPIcs.SoCG.2022.17}, annote = {Keywords: Computational Geometry, Surface Recognition, Treewidth, Hasse Diagram, Simplicial Complexes, Low-Dimensional Topology, Parameterized Complexity, Computational Complexity} }
Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, and Galyna Livshyts. Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bonnet_et_al:LIPIcs.SoCG.2022.18, author = {Bonnet, Gilles and Dadush, Daniel and Grupel, Uri and Huiberts, Sophie and Livshyts, Galyna}, title = {{Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.18}, URN = {urn:nbn:de:0030-drops-160269}, doi = {10.4230/LIPIcs.SoCG.2022.18}, annote = {Keywords: Random Polytopes, Combinatorial Diameter, Hirsch Conjecture} }
Magnus Bakke Botnan, Steffen Oppermann, and Steve Oudot. Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{botnan_et_al:LIPIcs.SoCG.2022.19, author = {Botnan, Magnus Bakke and Oppermann, Steffen and Oudot, Steve}, title = {{Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.19}, URN = {urn:nbn:de:0030-drops-160276}, doi = {10.4230/LIPIcs.SoCG.2022.19}, annote = {Keywords: Topological data analysis, multi-parameter persistent homology} }
Karl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, Dániel Marx, and André Nusser. Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2022.20, author = {Bringmann, Karl and Kisfaludi‑Bak, S\'{a}ndor and K\"{u}nnemann, Marvin and Marx, D\'{a}niel and Nusser, Andr\'{e}}, title = {{Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.20}, URN = {urn:nbn:de:0030-drops-160287}, doi = {10.4230/LIPIcs.SoCG.2022.20}, annote = {Keywords: Dynamic Time Warping, Sequence Similarity Measures} }
Karl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, André Nusser, and Zahra Parsaeian. Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2022.21, author = {Bringmann, Karl and Kisfaludi‑Bak, S\'{a}ndor and K\"{u}nnemann, Marvin and Nusser, Andr\'{e} and Parsaeian, Zahra}, title = {{Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.21}, URN = {urn:nbn:de:0030-drops-160294}, doi = {10.4230/LIPIcs.SoCG.2022.21}, annote = {Keywords: Hardness in P, Geometric Intersection Graph, Graph Diameter, Orthogonal Vectors, Hyperclique Detection} }
Kevin Buchin, André Nusser, and Sampson Wong. Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2022.22, author = {Buchin, Kevin and Nusser, Andr\'{e} and Wong, Sampson}, title = {{Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.22}, URN = {urn:nbn:de:0030-drops-160307}, doi = {10.4230/LIPIcs.SoCG.2022.22}, annote = {Keywords: Computational Geometry, Curve Similarity, Fr\'{e}chet distance, Dynamic Time Warping, Continuous Dynamic Time Warping} }
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, and Josef Tkadlec. Long Plane Trees. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 23:1-23:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cabello_et_al:LIPIcs.SoCG.2022.23, author = {Cabello, Sergio and Hoffmann, Michael and Klost, Katharina and Mulzer, Wolfgang and Tkadlec, Josef}, title = {{Long Plane Trees}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {23:1--23:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.23}, URN = {urn:nbn:de:0030-drops-160311}, doi = {10.4230/LIPIcs.SoCG.2022.23}, annote = {Keywords: geometric network design, spanning trees, plane straight-line graphs, approximation algorithms} }
Robert Cardona, Justin Curry, Tung Lam, and Michael Lesnick. The Universal 𝓁^p-Metric on Merge Trees. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cardona_et_al:LIPIcs.SoCG.2022.24, author = {Cardona, Robert and Curry, Justin and Lam, Tung and Lesnick, Michael}, title = {{The Universal 𝓁^p-Metric on Merge Trees}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.24}, URN = {urn:nbn:de:0030-drops-160325}, doi = {10.4230/LIPIcs.SoCG.2022.24}, annote = {Keywords: merge trees, hierarchical clustering, persistent homology, Wasserstein distances, interleavings} }
Erin Wolf Chambers, Salman Parsa, and Hannah Schreiber. On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chambers_et_al:LIPIcs.SoCG.2022.25, author = {Chambers, Erin Wolf and Parsa, Salman and Schreiber, Hannah}, title = {{On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.25}, URN = {urn:nbn:de:0030-drops-160338}, doi = {10.4230/LIPIcs.SoCG.2022.25}, annote = {Keywords: computational topology, bottleneck optimal cycles, homology} }
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov. Parameterized Algorithms for Upward Planarity. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chaplick_et_al:LIPIcs.SoCG.2022.26, author = {Chaplick, Steven and Di Giacomo, Emilio and Frati, Fabrizio and Ganian, Robert and Raftopoulou, Chrysanthi N. and Simonov, Kirill}, title = {{Parameterized Algorithms for Upward Planarity}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.26}, URN = {urn:nbn:de:0030-drops-160349}, doi = {10.4230/LIPIcs.SoCG.2022.26}, annote = {Keywords: Upward planarity, parameterized algorithms, SPQR trees, treewidth, treedepth} }
Jean Chartier and Arnaud de Mesmay. Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chartier_et_al:LIPIcs.SoCG.2022.27, author = {Chartier, Jean and de Mesmay, Arnaud}, title = {{Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.27}, URN = {urn:nbn:de:0030-drops-160350}, doi = {10.4230/LIPIcs.SoCG.2022.27}, annote = {Keywords: Quasigeodesic, polyhedron, curve-shortening process, disk flow, weakly simple} }
Rajesh Chitnis and Nitin Saurabh. Tight Lower Bounds for Approximate & Exact k-Center in ℝ^d. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 28:1-28:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chitnis_et_al:LIPIcs.SoCG.2022.28, author = {Chitnis, Rajesh and Saurabh, Nitin}, title = {{Tight Lower Bounds for Approximate \& Exact k-Center in \mathbb{R}^d}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.28}, URN = {urn:nbn:de:0030-drops-160365}, doi = {10.4230/LIPIcs.SoCG.2022.28}, annote = {Keywords: k-center, Euclidean space, Exponential Time Hypothesis (ETH), lower bound} }
Lily Chung, Erik D. Demaine, Dylan Hendrickson, and Victor Luo. Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 29:1-29:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chung_et_al:LIPIcs.SoCG.2022.29, author = {Chung, Lily and Demaine, Erik D. and Hendrickson, Dylan and Luo, Victor}, title = {{Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {29:1--29:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.29}, URN = {urn:nbn:de:0030-drops-160371}, doi = {10.4230/LIPIcs.SoCG.2022.29}, annote = {Keywords: Graph drawing, folding, origami, polyhedral complex, algorithms} }
Jonathan B. Conroy and Csaba D. Tóth. Hop-Spanners for Geometric Intersection Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{conroy_et_al:LIPIcs.SoCG.2022.30, author = {Conroy, Jonathan B. and T\'{o}th, Csaba D.}, title = {{Hop-Spanners for Geometric Intersection Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.30}, URN = {urn:nbn:de:0030-drops-160381}, doi = {10.4230/LIPIcs.SoCG.2022.30}, annote = {Keywords: geometric intersection graph, unit disk graph, hop-spanner} }
Marco Contessoto, Facundo Mémoli, Anastasios Stefanou, and Ling Zhou. Persistent Cup-Length. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 31:1-31:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{contessoto_et_al:LIPIcs.SoCG.2022.31, author = {Contessoto, Marco and M\'{e}moli, Facundo and Stefanou, Anastasios and Zhou, Ling}, title = {{Persistent Cup-Length}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.31}, URN = {urn:nbn:de:0030-drops-160398}, doi = {10.4230/LIPIcs.SoCG.2022.31}, annote = {Keywords: cohomology, cup product, persistence, cup length, Gromov-Hausdorff distance} }
Gábor Damásdi and Dömötör Pálvölgyi. Three-Chromatic Geometric Hypergraphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{damasdi_et_al:LIPIcs.SoCG.2022.32, author = {Dam\'{a}sdi, G\'{a}bor and P\'{a}lv\"{o}lgyi, D\"{o}m\"{o}t\"{o}r}, title = {{Three-Chromatic Geometric Hypergraphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.32}, URN = {urn:nbn:de:0030-drops-160401}, doi = {10.4230/LIPIcs.SoCG.2022.32}, annote = {Keywords: Discrete geometry, Geometric hypergraph coloring, Decomposition of multiple coverings} }
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak. A Solution to Ringel’s Circle Problem. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{davies_et_al:LIPIcs.SoCG.2022.33, author = {Davies, James and Keller, Chaya and Kleist, Linda and Smorodinsky, Shakhar and Walczak, Bartosz}, title = {{A Solution to Ringel’s Circle Problem}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.33}, URN = {urn:nbn:de:0030-drops-160413}, doi = {10.4230/LIPIcs.SoCG.2022.33}, annote = {Keywords: circle arrangement, chromatic number, Gallai’s theorem, polynomial method} }
Tamal K. Dey, Woojin Kim, and Facundo Mémoli. Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.SoCG.2022.34, author = {Dey, Tamal K. and Kim, Woojin and M\'{e}moli, Facundo}, title = {{Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {34:1--34:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.34}, URN = {urn:nbn:de:0030-drops-160420}, doi = {10.4230/LIPIcs.SoCG.2022.34}, annote = {Keywords: Multiparameter persistent homology, Zigzag persistent homology, Generalized Persistence Diagrams, M\"{o}bius inversion} }
Tamal K. Dey, Michał Lipiński, Marian Mrozek, and Ryan Slechta. Tracking Dynamical Features via Continuation and Persistence. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 35:1-35:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.SoCG.2022.35, author = {Dey, Tamal K. and Lipi\'{n}ski, Micha{\l} and Mrozek, Marian and Slechta, Ryan}, title = {{Tracking Dynamical Features via Continuation and Persistence}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {35:1--35:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.35}, URN = {urn:nbn:de:0030-drops-160439}, doi = {10.4230/LIPIcs.SoCG.2022.35}, annote = {Keywords: combinatorial dynamical systems, continuation, index pair, Conley index, persistent homology} }
Anne Driemel, Ivor van der Hoog, and Eva Rotenberg. On the Discrete Fréchet Distance in a Graph. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz Internationa