41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 1-1346, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@Proceedings{aichholzer_et_al:LIPIcs.SoCG.2025, title = {{LIPIcs, Volume 332, SoCG 2025, Complete Volume}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {1--1346}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025}, URN = {urn:nbn:de:0030-drops-235578}, doi = {10.4230/LIPIcs.SoCG.2025}, annote = {Keywords: LIPIcs, Volume 332, SoCG 2025, Complete Volume} }
41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 0:i-0:xxii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2025.0, author = {Aichholzer, Oswin and Wang, Haitao}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {0:i--0:xxii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.0}, URN = {urn:nbn:de:0030-drops-235566}, doi = {10.4230/LIPIcs.SoCG.2025.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, and Jack Stade. Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 1:1-1:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2025.1, author = {Abrahamsen, Mikkel and Buchin, Kevin and Buchin, Maike and Kleist, Linda and L\"{o}ffler, Maarten and Schlipf, Lena and Schulz, Andr\'{e} and Stade, Jack}, title = {{Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.1}, URN = {urn:nbn:de:0030-drops-231539}, doi = {10.4230/LIPIcs.SoCG.2025.1}, annote = {Keywords: reconfiguration, unit square, unit disk, unlabeled, labeled, simple polygon, polygon} }
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Raffay. The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ackerman_et_al:LIPIcs.SoCG.2025.2, author = {Ackerman, Eyal and Dam\'{a}sdi, G\'{a}bor and Keszegh, Bal\'{a}zs and Pinchasi, Rom and Raffay, Rebeka}, title = {{The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.2}, URN = {urn:nbn:de:0030-drops-231548}, doi = {10.4230/LIPIcs.SoCG.2025.2}, annote = {Keywords: pairwise intersecting arrangement, arrangement of pseudocircles, counting digons, tangencies, Gr\"{u}nbaum’s conjecture} }
Peyman Afshani, Yakov Nekrich, and Frank Staals. Convexity Helps Iterated Search in 3D. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2025.3, author = {Afshani, Peyman and Nekrich, Yakov and Staals, Frank}, title = {{Convexity Helps Iterated Search in 3D}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.3}, URN = {urn:nbn:de:0030-drops-231558}, doi = {10.4230/LIPIcs.SoCG.2025.3}, annote = {Keywords: Data structures, range searching} }
Pankaj K. Agarwal, Boris Aronov, Olivier Devillers, Christian Knauer, and Guillaume Moroz. A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2025.4, author = {Agarwal, Pankaj K. and Aronov, Boris and Devillers, Olivier and Knauer, Christian and Moroz, Guillaume}, title = {{A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {4:1--4:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.4}, URN = {urn:nbn:de:0030-drops-231561}, doi = {10.4230/LIPIcs.SoCG.2025.4}, annote = {Keywords: Terrain similarity, volume computation, polynomial interpolation, geometric cuttings, bivariate multipoint evaluation} }
Pankaj K. Agarwal, Mark de Berg, Benjamin Holmgren, Alex Steiger, and Martijn Struijs. Optimal Motion Planning for Two Square Robots in a Rectilinear Environment. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2025.5, author = {Agarwal, Pankaj K. and de Berg, Mark and Holmgren, Benjamin and Steiger, Alex and Struijs, Martijn}, title = {{Optimal Motion Planning for Two Square Robots in a Rectilinear Environment}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.5}, URN = {urn:nbn:de:0030-drops-231577}, doi = {10.4230/LIPIcs.SoCG.2025.5}, annote = {Keywords: Computational geometry, motion planning, multiple robots, rectilinear paths} }
Ángel Javier Alonso. A Sparse Multicover Bifiltration of Linear Size. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{alonso:LIPIcs.SoCG.2025.6, author = {Alonso, \'{A}ngel Javier}, title = {{A Sparse Multicover Bifiltration of Linear Size}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.6}, URN = {urn:nbn:de:0030-drops-231587}, doi = {10.4230/LIPIcs.SoCG.2025.6}, annote = {Keywords: Multicover, Approximation, Sparsification, Multiparameter persistence} }
Shinwoo An, Eunjin Oh, and Jie Xue. Single-Source Shortest Path Problem in Weighted Disk Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{an_et_al:LIPIcs.SoCG.2025.7, author = {An, Shinwoo and Oh, Eunjin and Xue, Jie}, title = {{Single-Source Shortest Path Problem in Weighted Disk Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.7}, URN = {urn:nbn:de:0030-drops-231594}, doi = {10.4230/LIPIcs.SoCG.2025.7}, annote = {Keywords: Disk graphs, shortest path problem, compressed quadtrees} }
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, and Jiaheng Wang. Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{anand_et_al:LIPIcs.SoCG.2025.8, author = {Anand, Konrad and Feng, Weiming and Freifeld, Graham and Guo, Heng and Jerrum, Mark and Wang, Jiaheng}, title = {{Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.8}, URN = {urn:nbn:de:0030-drops-231607}, doi = {10.4230/LIPIcs.SoCG.2025.8}, annote = {Keywords: non-crossing spanning trees, Markov chain, mixing time} }
Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, and Antonios Symvonis. Geometric Realizations of Dichotomous Ordinal Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{angelini_et_al:LIPIcs.SoCG.2025.9, author = {Angelini, Patrizio and Cornelsen, Sabine and Haase, Carolina and Hoffmann, Michael and Katsanou, Eleni and Montecchiani, Fabrizio and Steiner, Raphael and Symvonis, Antonios}, title = {{Geometric Realizations of Dichotomous Ordinal Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.9}, URN = {urn:nbn:de:0030-drops-231616}, doi = {10.4230/LIPIcs.SoCG.2025.9}, annote = {Keywords: Ordinal embeddings, geometric graphs, graph representations} }
Dustin L. Arendt, Matthew Broussard, Bala Krishnamoorthy, Nathaniel Saul, and Amber Thrall. Steinhaus Filtration and Stable Paths in the Mapper. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{arendt_et_al:LIPIcs.SoCG.2025.10, author = {Arendt, Dustin L. and Broussard, Matthew and Krishnamoorthy, Bala and Saul, Nathaniel and Thrall, Amber}, title = {{Steinhaus Filtration and Stable Paths in the Mapper}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {10:1--10:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.10}, URN = {urn:nbn:de:0030-drops-231625}, doi = {10.4230/LIPIcs.SoCG.2025.10}, annote = {Keywords: Cover and nerve, Jaccard distance, persistence stability, Mapper, recommender systems, explainable machine learning} }
Dominique Attali, Mattéo Clémot, Bianca B. Dornelas, and André Lieutier. When Alpha-Complexes Collapse onto Codimension-1 Submanifolds. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{attali_et_al:LIPIcs.SoCG.2025.11, author = {Attali, Dominique and Cl\'{e}mot, Matt\'{e}o and Dornelas, Bianca B. and Lieutier, Andr\'{e}}, title = {{When Alpha-Complexes Collapse onto Codimension-1 Submanifolds}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.11}, URN = {urn:nbn:de:0030-drops-231630}, doi = {10.4230/LIPIcs.SoCG.2025.11}, annote = {Keywords: Submanifold reconstruction, triangulation, abstract simplicial complexes, collapses, convexity} }
Sang Won Bae, Nicolau Oliver, and Evanthia Papadopoulou. Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 12:1-12:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bae_et_al:LIPIcs.SoCG.2025.12, author = {Bae, Sang Won and Oliver, Nicolau and Papadopoulou, Evanthia}, title = {{Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {12:1--12:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.12}, URN = {urn:nbn:de:0030-drops-231647}, doi = {10.4230/LIPIcs.SoCG.2025.12}, annote = {Keywords: higher-order Voronoi diagrams, color Voronoi diagrams, Hausdorff Voronoi diagrams, colored j-facets, arrangements, Clarkson-Shor technique} }
Jineon Baek and Martin Balko. The Erdős-Szekeres Conjecture Revisited. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{baek_et_al:LIPIcs.SoCG.2025.13, author = {Baek, Jineon and Balko, Martin}, title = {{The Erd\H{o}s-Szekeres Conjecture Revisited}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.13}, URN = {urn:nbn:de:0030-drops-231655}, doi = {10.4230/LIPIcs.SoCG.2025.13}, annote = {Keywords: convex position, Erd\H{o}s-Szekeres theorem, point set} }
Lies Beers and Magnus Bakke Botnan. Extremal Betti Numbers and Persistence in Flag Complexes. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{beers_et_al:LIPIcs.SoCG.2025.14, author = {Beers, Lies and Bakke Botnan, Magnus}, title = {{Extremal Betti Numbers and Persistence in Flag Complexes}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.14}, URN = {urn:nbn:de:0030-drops-231668}, doi = {10.4230/LIPIcs.SoCG.2025.14}, annote = {Keywords: Topological data analysis, Extremal graph theory} }
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, and Saket Saurabh. When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bentert_et_al:LIPIcs.SoCG.2025.15, author = {Bentert, Matthias and Fomin, Fedor V. and Golovach, Petr A. and Ramanujan, M. S. and Saurabh, Saket}, title = {{When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.15}, URN = {urn:nbn:de:0030-drops-231672}, doi = {10.4230/LIPIcs.SoCG.2025.15}, annote = {Keywords: Parameterized Complexity, Euclidean Embedding, FPT-approximation} }
Helena Bergold, Lukas Egeling, and Hung P. Hoang. Signotopes with Few Plus Signs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bergold_et_al:LIPIcs.SoCG.2025.16, author = {Bergold, Helena and Egeling, Lukas and Hoang, Hung P.}, title = {{Signotopes with Few Plus Signs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.16}, URN = {urn:nbn:de:0030-drops-231681}, doi = {10.4230/LIPIcs.SoCG.2025.16}, annote = {Keywords: flip graph, higher Bruhat order, signotope, counting, Ferrers diagram, one-element extension} }
Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, and Csaba D. Tóth. Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bhore_et_al:LIPIcs.SoCG.2025.17, author = {Bhore, Sujoy and Chan, Timothy M. and Huang, Zhengcheng and Smorodinsky, Shakhar and T\'{o}th, Csaba D.}, title = {{Sparse Bounded Hop-Spanners for Geometric Intersection Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.17}, URN = {urn:nbn:de:0030-drops-231698}, doi = {10.4230/LIPIcs.SoCG.2025.17}, annote = {Keywords: Geometric Spanners, Geometric Intersection Graphs} }
Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, and Günter Rote. Finding a Shortest Curve That Separates Few Objects from Many. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{biedl_et_al:LIPIcs.SoCG.2025.18, author = {Biedl, Therese and Colin de Verdi\`{e}re, \'{E}ric and Frati, Fabrizio and Lubiw, Anna and Rote, G\"{u}nter}, title = {{Finding a Shortest Curve That Separates Few Objects from Many}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.18}, URN = {urn:nbn:de:0030-drops-231701}, doi = {10.4230/LIPIcs.SoCG.2025.18}, annote = {Keywords: Enclosure, curve, separation, weakly simple polygon, Euler tour} }
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, and Miloš Stojaković. Polychromatic Coloring of Tuples in Hypergraphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{biniaz_et_al:LIPIcs.SoCG.2025.19, author = {Biniaz, Ahmad and De Carufel, Jean-Lou and Maheshwari, Anil and Smid, Michiel and Smorodinsky, Shakhar and Stojakovi\'{c}, Milo\v{s}}, title = {{Polychromatic Coloring of Tuples in Hypergraphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.19}, URN = {urn:nbn:de:0030-drops-231718}, doi = {10.4230/LIPIcs.SoCG.2025.19}, annote = {Keywords: Hypergraph Coloring, Polychromatic Coloring, Geometric Hypergraphs, Cover Decomposable Hypergraphs, Epsilon Nets} }
Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas Shermer, Jack Spalding-Jamieson, Rolf Svenning, and Da Wei Zheng. Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 20:1-20:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{biniaz_et_al:LIPIcs.SoCG.2025.20, author = {Biniaz, Ahmad and Maheshwari, Anil and Merrild, Magnus Christian Ring and Mitchell, Joseph S. B. and Odak, Saeed and Polishchuk, Valentin and Robson, Eliot W. and Rysgaard, Casper Moldrup and Schou, Jens Kristian Refsgaard and Shermer, Thomas and Spalding-Jamieson, Jack and Svenning, Rolf and Zheng, Da Wei}, title = {{Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {20:1--20:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.20}, URN = {urn:nbn:de:0030-drops-231720}, doi = {10.4230/LIPIcs.SoCG.2025.20}, annote = {Keywords: Art Gallery Problem, Computational Geometry, Combinatorics, Discrete Algorithms} }
Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, and Geert van Wordragen. Structure and Independence in Hyperbolic Uniform Disk Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{blasius_et_al:LIPIcs.SoCG.2025.21, author = {Bl\"{a}sius, Thomas and von der Heydt, Jean-Pierre and Kisfaludi-Bak, S\'{a}ndor and Wilhelm, Marcus and van Wordragen, Geert}, title = {{Structure and Independence in Hyperbolic Uniform Disk Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.21}, URN = {urn:nbn:de:0030-drops-231731}, doi = {10.4230/LIPIcs.SoCG.2025.21}, annote = {Keywords: hyperbolic geometry, unit disk graphs, independent set, treewidth} }
Lotte Blank, Jacobus Conradi, Anne Driemel, Benedikt Kolbe, André Nusser, and Marena Richter. Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{blank_et_al:LIPIcs.SoCG.2025.22, author = {Blank, Lotte and Conradi, Jacobus and Driemel, Anne and Kolbe, Benedikt and Nusser, Andr\'{e} and Richter, Marena}, title = {{Transforming Dogs on the Line: On the Fr\'{e}chet Distance Under Translation or Scaling in 1D}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.22}, URN = {urn:nbn:de:0030-drops-231746}, doi = {10.4230/LIPIcs.SoCG.2025.22}, annote = {Keywords: Fr\'{e}chet distance under translation, Fr\'{e}chet distance under scaling, time series, shape matching} }
Édouard Bonnet and Kristóf Huszár. On the Twin-Width of Smooth Manifolds. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bonnet_et_al:LIPIcs.SoCG.2025.23, author = {Bonnet, \'{E}douard and Husz\'{a}r, Krist\'{o}f}, title = {{On the Twin-Width of Smooth Manifolds}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.23}, URN = {urn:nbn:de:0030-drops-231752}, doi = {10.4230/LIPIcs.SoCG.2025.23}, annote = {Keywords: Smooth manifolds, triangulations, twin-width, Whitney embedding theorem, structural graph parameters, computational topology} }
Édouard Bonnet and Paweł Rzążewski. An 11/6-Approximation Algorithm for Vertex Cover on String Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bonnet_et_al:LIPIcs.SoCG.2025.24, author = {Bonnet, \'{E}douard and Rz\k{a}\.{z}ewski, Pawe{\l}}, title = {{An 11/6-Approximation Algorithm for Vertex Cover on String Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.24}, URN = {urn:nbn:de:0030-drops-231764}, doi = {10.4230/LIPIcs.SoCG.2025.24}, annote = {Keywords: Approximation algorithms, string graphs, Vertex Cover, Coloring, odd girth} }
Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, and Yanheng Wang. Approximating Klee’s Measure Problem and a Lower Bound for Union Volume Estimation. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2025.25, author = {Bringmann, Karl and Larsen, Kasper Green and Nusser, Andr\'{e} and Rotenberg, Eva and Wang, Yanheng}, title = {{Approximating Klee’s Measure Problem and a Lower Bound for Union Volume Estimation}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.25}, URN = {urn:nbn:de:0030-drops-231778}, doi = {10.4230/LIPIcs.SoCG.2025.25}, annote = {Keywords: approximation, volume of union, union of objects, query complexity} }
Kevin Buchin, Carolin Rehs, and Torben Scheele. Geometric Spanners of Bounded Tree-Width. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2025.26, author = {Buchin, Kevin and Rehs, Carolin and Scheele, Torben}, title = {{Geometric Spanners of Bounded Tree-Width}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.26}, URN = {urn:nbn:de:0030-drops-231786}, doi = {10.4230/LIPIcs.SoCG.2025.26}, annote = {Keywords: Computational Geometry, Geometric Spanner, Tree-width} }
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, and Sampson Wong. Computing Oriented Spanners and Their Dilation. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2025.27, author = {Buchin, Kevin and Kalb, Antonia and Maheshwari, Anil and Odak, Saeed and Rehs, Carolin and Smid, Michiel and Wong, Sampson}, title = {{Computing Oriented Spanners and Their Dilation}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {27:1--27:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.27}, URN = {urn:nbn:de:0030-drops-231792}, doi = {10.4230/LIPIcs.SoCG.2025.27}, annote = {Keywords: spanner, oriented graph, dilation, orientation, well-separated pair decomposition, minimum-perimeter triangle} }
Rhuaidi Antonio Burke, Benjamin A. Burton, and Jonathan Spreer. Small Triangulations of 4-Manifolds and the 4-Manifold Census. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{burke_et_al:LIPIcs.SoCG.2025.28, author = {Burke, Rhuaidi Antonio and Burton, Benjamin A. and Spreer, Jonathan}, title = {{Small Triangulations of 4-Manifolds and the 4-Manifold Census}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.28}, URN = {urn:nbn:de:0030-drops-231805}, doi = {10.4230/LIPIcs.SoCG.2025.28}, annote = {Keywords: computational low-dimensional topology, triangulations, census of triangulations, 4-manifolds, PL standard 4-sphere, Pachner graph, mathematical software, experiments in low-dimensional topology} }
Mathieu Carrière, Seunghyun Kim, and Woojin Kim. Sparsification of the Generalized Persistence Diagrams for Scalability Through Gradient Descent. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 29:1-29:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{carriere_et_al:LIPIcs.SoCG.2025.29, author = {Carri\`{e}re, Mathieu and Kim, Seunghyun and Kim, Woojin}, title = {{Sparsification of the Generalized Persistence Diagrams for Scalability Through Gradient Descent}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {29:1--29:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.29}, URN = {urn:nbn:de:0030-drops-231810}, doi = {10.4230/LIPIcs.SoCG.2025.29}, annote = {Keywords: Multi-parameter persistent homology, Generalized persistence diagram, Generalized rank invariant, Non-convex optimization, Gradient descent} }
Luca Castelli Aleardi, Eric Fusy, Jyh-Chwen Ko, and Razvan-Stefan Puscasu. Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to Practice. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{castellialeardi_et_al:LIPIcs.SoCG.2025.30, author = {Castelli Aleardi, Luca and Fusy, Eric and Ko, Jyh-Chwen and Puscasu, Razvan-Stefan}, title = {{Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to Practice}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {30:1--30:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.30}, URN = {urn:nbn:de:0030-drops-231825}, doi = {10.4230/LIPIcs.SoCG.2025.30}, annote = {Keywords: Schnyder woods, toroidal triangulations, canonical ordering} }
Timothy M. Chan and Isaac M. Hair. A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chan_et_al:LIPIcs.SoCG.2025.31, author = {Chan, Timothy M. and Hair, Isaac M.}, title = {{A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.31}, URN = {urn:nbn:de:0030-drops-231832}, doi = {10.4230/LIPIcs.SoCG.2025.31}, annote = {Keywords: Convex polygons, shape matching, prune-and-search, parametric search} }
Timothy M. Chan and Zhengcheng Huang. Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 32:1-32:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chan_et_al:LIPIcs.SoCG.2025.32, author = {Chan, Timothy M. and Huang, Zhengcheng}, title = {{Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.32}, URN = {urn:nbn:de:0030-drops-231845}, doi = {10.4230/LIPIcs.SoCG.2025.32}, annote = {Keywords: Geometric optimization problems, parametric search, shortest path, disk graphs, Fr\'{e}chet distance, visibility, distance selection, randomized algorithms} }
Timothy M. Chan, Chaya Keller, and Shakhar Smorodinsky. On Zarankiewicz’s Problem for Intersection Hypergraphs of Geometric Objects. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chan_et_al:LIPIcs.SoCG.2025.33, author = {Chan, Timothy M. and Keller, Chaya and Smorodinsky, Shakhar}, title = {{On Zarankiewicz’s Problem for Intersection Hypergraphs of Geometric Objects}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.33}, URN = {urn:nbn:de:0030-drops-231850}, doi = {10.4230/LIPIcs.SoCG.2025.33}, annote = {Keywords: Zarankiewicz’s Problem, hypergraphs, intersection graphs, axis-parallel boxes, pseudo-discs} }
Siu-Wing Cheng, Haoqiang Huang, and Le Jiang. Simplification of Trajectory Streams. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{cheng_et_al:LIPIcs.SoCG.2025.34, author = {Cheng, Siu-Wing and Huang, Haoqiang and Jiang, Le}, title = {{Simplification of Trajectory Streams}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.34}, URN = {urn:nbn:de:0030-drops-231860}, doi = {10.4230/LIPIcs.SoCG.2025.34}, annote = {Keywords: streaming algorithm, curve simplification, Fr\'{e}chet distance} }
Oliver A. Chubet, Kirk P. Gardner, and Donald R. Sheehy. A Theory of Sub-Barcodes. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chubet_et_al:LIPIcs.SoCG.2025.35, author = {Chubet, Oliver A. and Gardner, Kirk P. and Sheehy, Donald R.}, title = {{A Theory of Sub-Barcodes}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.35}, URN = {urn:nbn:de:0030-drops-231873}, doi = {10.4230/LIPIcs.SoCG.2025.35}, annote = {Keywords: Topology, Topological Data Analysis, Persistent Homology, Persistence Modules, Barcodes, Sub-barcodes, Factorizations, Lipschitz Extensions} }
James Davies, Agelos Georgakopoulos, Meike Hatzel, and Rose McCarty. Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{davies_et_al:LIPIcs.SoCG.2025.36, author = {Davies, James and Georgakopoulos, Agelos and Hatzel, Meike and McCarty, Rose}, title = {{Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.36}, URN = {urn:nbn:de:0030-drops-231881}, doi = {10.4230/LIPIcs.SoCG.2025.36}, annote = {Keywords: Intersection graphs, strongly sublinear separators, asymptotic dimension} }
Sarita de Berg and Frank Staals. Nearest Neighbor Searching in a Dynamic Simple Polygon. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 37:1-37:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{deberg_et_al:LIPIcs.SoCG.2025.37, author = {de Berg, Sarita and Staals, Frank}, title = {{Nearest Neighbor Searching in a Dynamic Simple Polygon}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.37}, URN = {urn:nbn:de:0030-drops-231896}, doi = {10.4230/LIPIcs.SoCG.2025.37}, annote = {Keywords: dynamic data structure, simple polygon, geodesic distance, nearest neighbor} }
Colleen Delaney, Clément Maria, and Eric Samperton. An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 38:1-38:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{delaney_et_al:LIPIcs.SoCG.2025.38, author = {Delaney, Colleen and Maria, Cl\'{e}ment and Samperton, Eric}, title = {{An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.38}, URN = {urn:nbn:de:0030-drops-231901}, doi = {10.4230/LIPIcs.SoCG.2025.38}, annote = {Keywords: 3-manifold, quantum invariant, fixed parameter tractable algorithm, topological parameter, Gauss sums, topological quantum field theory} }
Erik D. Demaine and Stefan Langerman. Tiling with Three Polygons Is Undecidable. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 39:1-39:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{demaine_et_al:LIPIcs.SoCG.2025.39, author = {Demaine, Erik D. and Langerman, Stefan}, title = {{Tiling with Three Polygons Is Undecidable}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {39:1--39:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.39}, URN = {urn:nbn:de:0030-drops-231913}, doi = {10.4230/LIPIcs.SoCG.2025.39}, annote = {Keywords: plane tilings, polygons, undecidability, co-RE} }
Tamal K. Dey, Tao Hou, and Dmitriy Morozov. Apex Representatives. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{dey_et_al:LIPIcs.SoCG.2025.40, author = {Dey, Tamal K. and Hou, Tao and Morozov, Dmitriy}, title = {{Apex Representatives}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {40:1--40:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.40}, URN = {urn:nbn:de:0030-drops-231927}, doi = {10.4230/LIPIcs.SoCG.2025.40}, annote = {Keywords: zigzag persistent homology, Mayer-Vietoris pyramid, cycle representatives} }
Tamal K. Dey, Jan Jendrysiak, and Michael Kerber. Decomposing Multiparameter Persistence Modules. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 41:1-41:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{dey_et_al:LIPIcs.SoCG.2025.41, author = {Dey, Tamal K. and Jendrysiak, Jan and Kerber, Michael}, title = {{Decomposing Multiparameter Persistence Modules}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {41:1--41:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.41}, URN = {urn:nbn:de:0030-drops-231939}, doi = {10.4230/LIPIcs.SoCG.2025.41}, annote = {Keywords: Topological Data Analysis, Multiparameter Persistence Modules, Persistence, Decomposition} }
Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, and David P. Woodruff. Range Counting Oracles for Geometric Problems. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 42:1-42:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{driemel_et_al:LIPIcs.SoCG.2025.42, author = {Driemel, Anne and Monemizadeh, Morteza and Oh, Eunjin and Staals, Frank and Woodruff, David P.}, title = {{Range Counting Oracles for Geometric Problems}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {42:1--42:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.42}, URN = {urn:nbn:de:0030-drops-231941}, doi = {10.4230/LIPIcs.SoCG.2025.42}, annote = {Keywords: Range counting oracles, minimum spanning trees, Earth Mover’s Distance} }
Herbert Edelsbrunner, Alexey Garber, and Morteza Saghafian. On Spheres with k Points Inside. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 43:1-43:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2025.43, author = {Edelsbrunner, Herbert and Garber, Alexey and Saghafian, Morteza}, title = {{On Spheres with k Points Inside}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {43:1--43:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.43}, URN = {urn:nbn:de:0030-drops-231951}, doi = {10.4230/LIPIcs.SoCG.2025.43}, annote = {Keywords: Triangulations, higher-order Delaunay triangulations, hypertriangulations, Delone sets, k-sets, Worpitzky’s identity, hypersimplices} }
Eduard Eiben, Robert Ganian, Iyad Kanj, and M. S. Ramanujan. A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 44:1-44:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{eiben_et_al:LIPIcs.SoCG.2025.44, author = {Eiben, Eduard and Ganian, Robert and Kanj, Iyad and Ramanujan, M. S.}, title = {{A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {44:1--44:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.44}, URN = {urn:nbn:de:0030-drops-231966}, doi = {10.4230/LIPIcs.SoCG.2025.44}, annote = {Keywords: coordinated motion planning on graphs, parameterized complexity, topological minor testing, planar graphs} }
Marzieh Eidi and Sayan Mukherjee. Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 45:1-45:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{eidi_et_al:LIPIcs.SoCG.2025.45, author = {Eidi, Marzieh and Mukherjee, Sayan}, title = {{Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.45}, URN = {urn:nbn:de:0030-drops-231972}, doi = {10.4230/LIPIcs.SoCG.2025.45}, annote = {Keywords: Bipartite graphs, Simplicial complex, Disorientability, Hodge Laplacian, odd cycles, Twisted cycles, down-dual graph} }
David Eppstein. Non-Euclidean Erdős-Anning Theorems. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 46:1-46:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{eppstein:LIPIcs.SoCG.2025.46, author = {Eppstein, David}, title = {{Non-Euclidean Erd\H{o}s-Anning Theorems}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {46:1--46:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.46}, URN = {urn:nbn:de:0030-drops-231983}, doi = {10.4230/LIPIcs.SoCG.2025.46}, annote = {Keywords: integer distances, additively weighted Voronoi diagrams, convex distance functions, Riemannian manifolds, geodesic distance} }
Jeff Erickson and Christian Howard. Shelling and Sinking Graphs on the Sphere. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 47:1-47:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{erickson_et_al:LIPIcs.SoCG.2025.47, author = {Erickson, Jeff and Howard, Christian}, title = {{Shelling and Sinking Graphs on the Sphere}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {47:1--47:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.47}, URN = {urn:nbn:de:0030-drops-231996}, doi = {10.4230/LIPIcs.SoCG.2025.47}, annote = {Keywords: morphing, planar graphs, spherical graph drawing, longitudinal shelling} }
Sándor P. Fekete, Phillip Keldenich, and Michael Perk. Exact Algorithms for Minimum Dilation Triangulation. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 48:1-48:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2025.48, author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Perk, Michael}, title = {{Exact Algorithms for Minimum Dilation Triangulation}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {48:1--48:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.48}, URN = {urn:nbn:de:0030-drops-232006}, doi = {10.4230/LIPIcs.SoCG.2025.48}, annote = {Keywords: dilation, minimum dilation triangulation, exact algorithms, algorithm engineering, experimental evaluation} }
Arnold Filtser. On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other Applications. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 49:1-49:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{filtser:LIPIcs.SoCG.2025.49, author = {Filtser, Arnold}, title = {{On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other Applications}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {49:1--49:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.49}, URN = {urn:nbn:de:0030-drops-232015}, doi = {10.4230/LIPIcs.SoCG.2025.49}, annote = {Keywords: Sparse cover, minor free graphs, metric embeddings, 𝓁\underline∞, oblivious buy-at-bulk} }
Jacob Fox, János Pach, and Andrew Suk. Immersions and Albertson’s Conjecture. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 50:1-50:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{fox_et_al:LIPIcs.SoCG.2025.50, author = {Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew}, title = {{Immersions and Albertson’s Conjecture}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {50:1--50:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.50}, URN = {urn:nbn:de:0030-drops-232022}, doi = {10.4230/LIPIcs.SoCG.2025.50}, annote = {Keywords: Immersions, crossing numbers, chromatic number} }
Shion Fukuzawa, Michael T. Goodrich, and Sandy Irani. Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 51:1-51:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{fukuzawa_et_al:LIPIcs.SoCG.2025.51, author = {Fukuzawa, Shion and Goodrich, Michael T. and Irani, Sandy}, title = {{Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {51:1--51:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.51}, URN = {urn:nbn:de:0030-drops-232035}, doi = {10.4230/LIPIcs.SoCG.2025.51}, annote = {Keywords: quantum computing, computational geometry, divide and conquer, convex hulls, maxima sets} }
Abhibhav Garg, Rafael Oliveira, and Akash Kumar Sengupta. Uniform Bounds on Product Sylvester-Gallai Configurations. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{garg_et_al:LIPIcs.SoCG.2025.52, author = {Garg, Abhibhav and Oliveira, Rafael and Sengupta, Akash Kumar}, title = {{Uniform Bounds on Product Sylvester-Gallai Configurations}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {52:1--52:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.52}, URN = {urn:nbn:de:0030-drops-232043}, doi = {10.4230/LIPIcs.SoCG.2025.52}, annote = {Keywords: Sylvester-Gallai theorem, arrangements of hypersurfaces, algebraic complexity, polynomial identity testing, algebraic geometry, commutative algebra} }
Benyamin Ghaseminia and Mohammad R. Salavatipour. A PTAS for TSP with Neighbourhoods over Parallel Line Segments. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ghaseminia_et_al:LIPIcs.SoCG.2025.53, author = {Ghaseminia, Benyamin and Salavatipour, Mohammad R.}, title = {{A PTAS for TSP with Neighbourhoods over Parallel Line Segments}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.53}, URN = {urn:nbn:de:0030-drops-232058}, doi = {10.4230/LIPIcs.SoCG.2025.53}, annote = {Keywords: Approximation Scheme, TSP Neighbourhood, Parallel line segments} }
Sariel Har-Peled, Benjamin Raichel, and Eliot W. Robson. The Fréchet Distance Unleashed: Approximating a Dog with a Frog. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 54:1-54:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2025.54, author = {Har-Peled, Sariel and Raichel, Benjamin and Robson, Eliot W.}, title = {{The Fr\'{e}chet Distance Unleashed: Approximating a Dog with a Frog}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {54:1--54:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.54}, URN = {urn:nbn:de:0030-drops-232066}, doi = {10.4230/LIPIcs.SoCG.2025.54}, annote = {Keywords: Curve similarity, Fr\'{e}chet distance} }
Alexander He, Eric Sedgwick, and Jonathan Spreer. A Practical Algorithm for Knot Factorisation. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{he_et_al:LIPIcs.SoCG.2025.55, author = {He, Alexander and Sedgwick, Eric and Spreer, Jonathan}, title = {{A Practical Algorithm for Knot Factorisation}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.55}, URN = {urn:nbn:de:0030-drops-232075}, doi = {10.4230/LIPIcs.SoCG.2025.55}, annote = {Keywords: Prime and composite knots, (crushing) normal surfaces, edge-ideal triangulations, co-NP certificate, triangulation complexity} }
Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, and Zihang Wu. Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 56:1-56:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{herold_et_al:LIPIcs.SoCG.2025.56, author = {Herold, Martin G. and Nanongkai, Danupon and Spoerhase, Joachim and Varma, Nithin and Wu, Zihang}, title = {{Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {56:1--56:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.56}, URN = {urn:nbn:de:0030-drops-232087}, doi = {10.4230/LIPIcs.SoCG.2025.56}, annote = {Keywords: sublinear data structure, approximate nearest neighbor} }
John Hershberger. Snap Rounding: A Cautionary Tale. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hershberger:LIPIcs.SoCG.2025.57, author = {Hershberger, John}, title = {{Snap Rounding: A Cautionary Tale}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.57}, URN = {urn:nbn:de:0030-drops-232097}, doi = {10.4230/LIPIcs.SoCG.2025.57}, annote = {Keywords: Snap rounding, implementation, computational geometry} }
Tao Hou, Salman Parsa, and Bei Wang. Tracking the Persistence of Harmonic Chains: Barcode and Stability. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 58:1-58:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hou_et_al:LIPIcs.SoCG.2025.58, author = {Hou, Tao and Parsa, Salman and Wang, Bei}, title = {{Tracking the Persistence of Harmonic Chains: Barcode and Stability}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {58:1--58:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.58}, URN = {urn:nbn:de:0030-drops-232100}, doi = {10.4230/LIPIcs.SoCG.2025.58}, annote = {Keywords: Persistent homology, harmonic chains, topological data analysis} }
John Iacono and Yakov Nekrich. Incremental Planar Nearest Neighbor Queries with Optimal Query Time. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 59:1-59:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{iacono_et_al:LIPIcs.SoCG.2025.59, author = {Iacono, John and Nekrich, Yakov}, title = {{Incremental Planar Nearest Neighbor Queries with Optimal Query Time}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.59}, URN = {urn:nbn:de:0030-drops-232117}, doi = {10.4230/LIPIcs.SoCG.2025.59}, annote = {Keywords: Data Structures, Dynamic Data Structures, Nearest Neighbor Queries} }
Klaus Jansen, Debajyoti Kar, Arindam Khan, K. V. N. Sreenivas, and Malte Tutas. Improved Approximation Algorithms for Three-Dimensional Knapsack. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 60:1-60:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{jansen_et_al:LIPIcs.SoCG.2025.60, author = {Jansen, Klaus and Kar, Debajyoti and Khan, Arindam and Sreenivas, K. V. N. and Tutas, Malte}, title = {{Improved Approximation Algorithms for Three-Dimensional Knapsack}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {60:1--60:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.60}, URN = {urn:nbn:de:0030-drops-232126}, doi = {10.4230/LIPIcs.SoCG.2025.60}, annote = {Keywords: Approximation Algorithms, Hyperrectangle Packing, Multidimensional Knapsack, Three-dimensional Packing} }
Attila Jung and Dömötör Pálvölgyi. k-Dimensional Transversals for Fat Convex Sets. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 61:1-61:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{jung_et_al:LIPIcs.SoCG.2025.61, author = {Jung, Attila and P\'{a}lv\"{o}lgyi, D\"{o}m\"{o}t\"{o}r}, title = {{k-Dimensional Transversals for Fat Convex Sets}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {61:1--61:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.61}, URN = {urn:nbn:de:0030-drops-232136}, doi = {10.4230/LIPIcs.SoCG.2025.61}, annote = {Keywords: discrete geometry, transversals, Helly, hypergraphs} }
Karthik C. S., Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, and Samson Zhou. On Approximability of 𝓁₂² Min-Sum Clustering. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 62:1-62:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{karthikc.s._et_al:LIPIcs.SoCG.2025.62, author = {Karthik C. S. and Lee, Euiwoong and Rabani, Yuval and Schwiegelshohn, Chris and Zhou, Samson}, title = {{On Approximability of 𝓁₂² Min-Sum Clustering}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {62:1--62:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.62}, URN = {urn:nbn:de:0030-drops-232142}, doi = {10.4230/LIPIcs.SoCG.2025.62}, annote = {Keywords: Clustering, hardness of approximation, polynomial-time approximation schemes, learning-augmented algorithms} }
J. Mark Keil and Debajyoti Mondal. The Maximum Clique Problem in a Disk Graph Made Easy. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 63:1-63:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{keil_et_al:LIPIcs.SoCG.2025.63, author = {Keil, J. Mark and Mondal, Debajyoti}, title = {{The Maximum Clique Problem in a Disk Graph Made Easy}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {63:1--63:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.63}, URN = {urn:nbn:de:0030-drops-232155}, doi = {10.4230/LIPIcs.SoCG.2025.63}, annote = {Keywords: Geometric Intersection Graphs, Disk Graphs, Ball Graphs, Maximum Clique} }
Donghan Kim, Woojin Kim, and Wonjun Lee. Super-Polynomial Growth of the Generalized Persistence Diagram. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 64:1-64:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{kim_et_al:LIPIcs.SoCG.2025.64, author = {Kim, Donghan and Kim, Woojin and Lee, Wonjun}, title = {{Super-Polynomial Growth of the Generalized Persistence Diagram}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {64:1--64:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.64}, URN = {urn:nbn:de:0030-drops-232162}, doi = {10.4230/LIPIcs.SoCG.2025.64}, annote = {Keywords: Persistent homology, M\"{o}bius inversion, Multiparameter persistence, Generalized persistence diagram, Generalized rank invariant} }
Yasuaki Kobayashi, Yuto Okada, and Alexander Wolff. Recognizing 2-Layer and Outer k-Planar Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 65:1-65:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{kobayashi_et_al:LIPIcs.SoCG.2025.65, author = {Kobayashi, Yasuaki and Okada, Yuto and Wolff, Alexander}, title = {{Recognizing 2-Layer and Outer k-Planar Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {65:1--65:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.65}, URN = {urn:nbn:de:0030-drops-232170}, doi = {10.4230/LIPIcs.SoCG.2025.65}, annote = {Keywords: 2-layer k-planar graphs, outer k-planar graphs, recognition algorithms, local crossing number, bandwidth, FPT, XNLP, XP, W\lbrackt\rbrack} }
Robert Krauthgamer and Nir Petruschka. Lipschitz Decompositions of Finite 𝓁_{p} Metrics. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 66:1-66:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{krauthgamer_et_al:LIPIcs.SoCG.2025.66, author = {Krauthgamer, Robert and Petruschka, Nir}, title = {{Lipschitz Decompositions of Finite 𝓁\underline\{p\} Metrics}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {66:1--66:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.66}, URN = {urn:nbn:de:0030-drops-232182}, doi = {10.4230/LIPIcs.SoCG.2025.66}, annote = {Keywords: Lipschitz decompositions, metric embeddings, geometric spanners} }
Corentin Lunel, Arnaud de Mesmay, and Jonathan Spreer. Hard Diagrams of Split Links. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 67:1-67:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{lunel_et_al:LIPIcs.SoCG.2025.67, author = {Lunel, Corentin and de Mesmay, Arnaud and Spreer, Jonathan}, title = {{Hard Diagrams of Split Links}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {67:1--67:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.67}, URN = {urn:nbn:de:0030-drops-232191}, doi = {10.4230/LIPIcs.SoCG.2025.67}, annote = {Keywords: Knot theory, hard knot and link diagrams, Reidemeister moves, extra crossings, split links, bubble tangles, compression representativity} }
Dmitriy Morozov and Primoz Skraba. Persistent (Co)Homology in Matrix Multiplication Time. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 68:1-68:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{morozov_et_al:LIPIcs.SoCG.2025.68, author = {Morozov, Dmitriy and Skraba, Primoz}, title = {{Persistent (Co)Homology in Matrix Multiplication Time}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {68:1--68:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.68}, URN = {urn:nbn:de:0030-drops-232204}, doi = {10.4230/LIPIcs.SoCG.2025.68}, annote = {Keywords: persistent homology, matrix multiplication, cycle representatives} }
Dmitriy Morozov and Luis Scoccola. Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 69:1-69:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{morozov_et_al:LIPIcs.SoCG.2025.69, author = {Morozov, Dmitriy and Scoccola, Luis}, title = {{Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {69:1--69:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.69}, URN = {urn:nbn:de:0030-drops-232219}, doi = {10.4230/LIPIcs.SoCG.2025.69}, annote = {Keywords: Multiparameter persistence, Zero-dimensional homology, Minimal presentation, Betti table} }
Tim Ophelders, Anna Schenfisch, Willem Sonke, and Bettina Speckmann. Computing Geomorphologically Salient Networks via Discrete Morse Theory. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 70:1-70:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ophelders_et_al:LIPIcs.SoCG.2025.70, author = {Ophelders, Tim and Schenfisch, Anna and Sonke, Willem and Speckmann, Bettina}, title = {{Computing Geomorphologically Salient Networks via Discrete Morse Theory}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {70:1--70:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.70}, URN = {urn:nbn:de:0030-drops-232221}, doi = {10.4230/LIPIcs.SoCG.2025.70}, annote = {Keywords: hydrology, network detection, intertidal zones, braided rivers, discrete Morse theory, volume persistence} }
Lara Ost, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner. Banana Trees for the Persistence in Time Series Experimentally. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 71:1-71:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ost_et_al:LIPIcs.SoCG.2025.71, author = {Ost, Lara and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert}, title = {{Banana Trees for the Persistence in Time Series Experimentally}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {71:1--71:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.71}, URN = {urn:nbn:de:0030-drops-232237}, doi = {10.4230/LIPIcs.SoCG.2025.71}, annote = {Keywords: persistent homology, time series, data structures, computational experiments} }
Sharath Raghvendra, Pouyan Shirzadian, and Rachita Sowle. Geometric Bipartite Matching Based Exact Algorithms for Server Problems. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 72:1-72:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{raghvendra_et_al:LIPIcs.SoCG.2025.72, author = {Raghvendra, Sharath and Shirzadian, Pouyan and Sowle, Rachita}, title = {{Geometric Bipartite Matching Based Exact Algorithms for Server Problems}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {72:1--72:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.72}, URN = {urn:nbn:de:0030-drops-232240}, doi = {10.4230/LIPIcs.SoCG.2025.72}, annote = {Keywords: Minimum-Cost Bipartite Matching, Server Problems, Primal-Dual Approach} }
Thomas Schibler, Subhash Suri, and Jie Xue. Embedding Graphs as Euclidean kNN-Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 73:1-73:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{schibler_et_al:LIPIcs.SoCG.2025.73, author = {Schibler, Thomas and Suri, Subhash and Xue, Jie}, title = {{Embedding Graphs as Euclidean kNN-Graphs}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {73:1--73:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.73}, URN = {urn:nbn:de:0030-drops-232253}, doi = {10.4230/LIPIcs.SoCG.2025.73}, annote = {Keywords: Geometric graphs, k-nearest neighbors, graph embedding, approximation algorithms} }
Jack Stade. The Point-Boundary Art Gallery Problem Is ∃ℝ-Hard. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 74:1-74:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{stade:LIPIcs.SoCG.2025.74, author = {Stade, Jack}, title = {{The Point-Boundary Art Gallery Problem Is \exists\mathbb{R}-Hard}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {74:1--74:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.74}, URN = {urn:nbn:de:0030-drops-232269}, doi = {10.4230/LIPIcs.SoCG.2025.74}, annote = {Keywords: Art Gallery Problem, Complexity, ETR, Polygon} }
Elizaveta Streltsova and Uli Wagner. Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 75:1-75:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{streltsova_et_al:LIPIcs.SoCG.2025.75, author = {Streltsova, Elizaveta and Wagner, Uli}, title = {{Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {75:1--75:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.75}, URN = {urn:nbn:de:0030-drops-232276}, doi = {10.4230/LIPIcs.SoCG.2025.75}, annote = {Keywords: Levels in arrangements, k-sets, k-facets, convex polytopes, f-vector, h-vector, g-vector, Dehn-Sommerville relations, Radon partitions, Gale duality, g-matrix} }
Andrew Suk and Ethan Patrick White. A Note on the No-(d+2)-On-a-Sphere Problem. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 76:1-76:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{suk_et_al:LIPIcs.SoCG.2025.76, author = {Suk, Andrew and White, Ethan Patrick}, title = {{A Note on the No-(d+2)-On-a-Sphere Problem}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {76:1--76:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.76}, URN = {urn:nbn:de:0030-drops-232287}, doi = {10.4230/LIPIcs.SoCG.2025.76}, annote = {Keywords: General position, no-four-on-a-cirle, d-dimensional lattice cube} }
Subhash Suri, Jie Xue, Xiongxin Yang, and Jiumu Zhu. Dynamic Maximum Depth of Geometric Objects. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 77:1-77:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{suri_et_al:LIPIcs.SoCG.2025.77, author = {Suri, Subhash and Xue, Jie and Yang, Xiongxin and Zhu, Jiumu}, title = {{Dynamic Maximum Depth of Geometric Objects}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {77:1--77:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.77}, URN = {urn:nbn:de:0030-drops-232295}, doi = {10.4230/LIPIcs.SoCG.2025.77}, annote = {Keywords: dynamic algorithms, maximum depth} }
Ivor van der Hoog, Lara Ost, Eva Rotenberg, and Daniel Rutschmann. Efficient Greedy Discrete Subtrajectory Clustering. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 78:1-78:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{vanderhoog_et_al:LIPIcs.SoCG.2025.78, author = {van der Hoog, Ivor and Ost, Lara and Rotenberg, Eva and Rutschmann, Daniel}, title = {{Efficient Greedy Discrete Subtrajectory Clustering}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {78:1--78:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.78}, URN = {urn:nbn:de:0030-drops-232308}, doi = {10.4230/LIPIcs.SoCG.2025.78}, annote = {Keywords: Algorithms engineering, Fr\'{e}chet distance, subtrajectory clustering} }
Mikkel Abrahamsen, Florestan Brunck, Jacobus Conradi, Benedikt Kolbe, and André Nusser. Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 79:1-79:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2025.79, author = {Abrahamsen, Mikkel and Brunck, Florestan and Conradi, Jacobus and Kolbe, Benedikt and Nusser, Andr\'{e}}, title = {{Computing Non-Obtuse Triangulations with Few Steiner Points}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {79:1--79:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.79}, URN = {urn:nbn:de:0030-drops-232311}, doi = {10.4230/LIPIcs.SoCG.2025.79}, annote = {Keywords: non-obtuse triangulation, local search, competition} }
Taehoon Ahn, Jaegun Lee, Byeonguk Kang, and Hwi Kim. Incremental Algorithm and Local Search for Minimum Non-Obtuse Triangulations (CG Challenge). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 80:1-80:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ahn_et_al:LIPIcs.SoCG.2025.80, author = {Ahn, Taehoon and Lee, Jaegun and Kang, Byeonguk and Kim, Hwi}, title = {{Incremental Algorithm and Local Search for Minimum Non-Obtuse Triangulations}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {80:1--80:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.80}, URN = {urn:nbn:de:0030-drops-232326}, doi = {10.4230/LIPIcs.SoCG.2025.80}, annote = {Keywords: Triangulation, Non-obtuse triangle, Steiner point, Incremental algorithm, Local search} }
Matthias Artmann, Tobias Maurer, Andreas Padalkin, Daniel Warner, and Christian Scheideler. AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 81:1-81:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{artmann_et_al:LIPIcs.SoCG.2025.81, author = {Artmann, Matthias and Maurer, Tobias and Padalkin, Andreas and Warner, Daniel and Scheideler, Christian}, title = {{AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {81:1--81:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.81}, URN = {urn:nbn:de:0030-drops-232338}, doi = {10.4230/LIPIcs.SoCG.2025.81}, annote = {Keywords: Programmable matter, amoebot model, reconfigurable circuits, joint movements, simulator} }
Hridhaan Banerjee, Carmen Isabel Day, Auguste H. Gezalyan, Olga Golovatskaia, Megan Hunleth, Sarah Hwang, Nithin Parepally, Lucy Wang, and David M. Mount. Software for the Thompson and Funk Polygonal Geometry (Media Exposition). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 82:1-82:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{banerjee_et_al:LIPIcs.SoCG.2025.82, author = {Banerjee, Hridhaan and Day, Carmen Isabel and Gezalyan, Auguste H. and Golovatskaia, Olga and Hunleth, Megan and Hwang, Sarah and Parepally, Nithin and Wang, Lucy and Mount, David M.}, title = {{Software for the Thompson and Funk Polygonal Geometry}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {82:1--82:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.82}, URN = {urn:nbn:de:0030-drops-232349}, doi = {10.4230/LIPIcs.SoCG.2025.82}, annote = {Keywords: Thompson metric, Hilbert metric, Funk metric, balls} }
Klint Faber, Auguste H. Gezalyan, Adam Martinson, Aniruddh Mutnuru, Nithin Parepally, Ryan Parker, Mihil Sreenilayam, Aram Zaprosyan, and David M. Mount. French Onion Soup, Ipelets for Points and Polygons (Media Exposition). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 83:1-83:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{faber_et_al:LIPIcs.SoCG.2025.83, author = {Faber, Klint and Gezalyan, Auguste H. and Martinson, Adam and Mutnuru, Aniruddh and Parepally, Nithin and Parker, Ryan and Sreenilayam, Mihil and Zaprosyan, Aram and Mount, David M.}, title = {{French Onion Soup, Ipelets for Points and Polygons}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {83:1--83:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.83}, URN = {urn:nbn:de:0030-drops-232350}, doi = {10.4230/LIPIcs.SoCG.2025.83}, annote = {Keywords: Hilbert metric, Macbeath Regions, Polar Bodies, convexity} }
Simon D. Fink and Dominik Peters. Incremental and Interactive PQ- and PC-Trees (Media Exposition). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 84:1-84:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{fink_et_al:LIPIcs.SoCG.2025.84, author = {Fink, Simon D. and Peters, Dominik}, title = {{Incremental and Interactive PQ- and PC-Trees}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {84:1--84:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.84}, URN = {urn:nbn:de:0030-drops-232365}, doi = {10.4230/LIPIcs.SoCG.2025.84}, annote = {Keywords: PQ trees, PC trees, planarity, consecutive ones problem, interactive exploration} }
UML Modular Robotics Group, Hugo A. Akitaya, Andrew Clements, Sam Downey, Jonathan Eisenbies, Soham Samanta, Gabriel Shahrouzi, and Frederick Stock. Finding Shortest Reconfiguration Sequences for Modular Robots (Media Exposition). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 85:1-85:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{umlmodularroboticsgroup_et_al:LIPIcs.SoCG.2025.85, author = {UML Modular Robotics Group and A. Akitaya, Hugo and Clements, Andrew and Downey, Sam and Eisenbies, Jonathan and Samanta, Soham and Shahrouzi, Gabriel and Stock, Frederick}, title = {{Finding Shortest Reconfiguration Sequences for Modular Robots}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {85:1--85:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.85}, URN = {urn:nbn:de:0030-drops-232371}, doi = {10.4230/LIPIcs.SoCG.2025.85}, annote = {Keywords: modular reconfigurable robots, sliding cube model, reconfiguration} }
Feedback for Dagstuhl Publishing