@Proceedings{mulzer_et_al:LIPIcs.SoCG.2024,
  title =	{{LIPIcs, Volume 293, SoCG 2024, Complete Volume}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{1--1412},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024},
  URN =		{urn:nbn:de:0030-drops-199441},
  doi =		{10.4230/LIPIcs.SoCG.2024},
  annote =	{Keywords: LIPIcs, Volume 293, SoCG 2024, Complete Volume}
}
@InProceedings{mulzer_et_al:LIPIcs.SoCG.2024.0,
  author =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{0:i--0:xxii},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.0},
  URN =		{urn:nbn:de:0030-drops-199457},
  doi =		{10.4230/LIPIcs.SoCG.2024.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abel_et_al:LIPIcs.SoCG.2024.1,
  author =	{Abel, Zachary and A. Akitaya, Hugo and Kominers, Scott Duke and Korman, Matias and Stock, Frederick},
  title =	{{A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{1:1--1:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.1},
  URN =		{urn:nbn:de:0030-drops-199468},
  doi =		{10.4230/LIPIcs.SoCG.2024.1},
  annote =	{Keywords: modular reconfigurable robots, sliding cube model, reconfiguration}
}
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2024.2,
  author =	{Abrahamsen, Mikkel and de Berg, Sarita and Meijer, Lucas and Nusser, Andr\'{e} and Theocharous, Leonidas},
  title =	{{Clustering with Few Disks to Minimize the Sum of Radii}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{2:1--2:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.2},
  URN =		{urn:nbn:de:0030-drops-199472},
  doi =		{10.4230/LIPIcs.SoCG.2024.2},
  annote =	{Keywords: geometric clustering, minimize sum of radii, covering points with disks}
}
@InProceedings{ackerman_et_al:LIPIcs.SoCG.2024.3,
  author =	{Ackerman, Eyal and Dam\'{a}sdi, G\'{a}bor and Keszegh, Bal\'{a}zs and Pinchasi, Rom and Raffay, Rebeka},
  title =	{{On the Number of Digons in Arrangements of Pairwise Intersecting Circles}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{3:1--3:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.3},
  URN =		{urn:nbn:de:0030-drops-199480},
  doi =		{10.4230/LIPIcs.SoCG.2024.3},
  annote =	{Keywords: Arrangement of pseudocircles, Counting touchings, Counting digons, Gr\"{u}nbaum’s conjecture}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2024.4,
  author =	{Agarwal, Pankaj K. and Ezra, Esther and Sharir, Micha},
  title =	{{Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{4:1--4:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.4},
  URN =		{urn:nbn:de:0030-drops-199497},
  doi =		{10.4230/LIPIcs.SoCG.2024.4},
  annote =	{Keywords: Range-searching, semi-algebraic sets, pseudo-lines, duality, geometric cuttings}
}
@InProceedings{ahmed_et_al:LIPIcs.SoCG.2024.5,
  author =	{Ahmed, Manasseh and Cheung, Tsun-Ming and Hatami, Hamed and Sareen, Kusha},
  title =	{{Communication Complexity and Discrepancy of Halfplanes}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{5:1--5:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.5},
  URN =		{urn:nbn:de:0030-drops-199504},
  doi =		{10.4230/LIPIcs.SoCG.2024.5},
  annote =	{Keywords: Randomized communication complexity, Discrepancy theory, factorization norm}
}
@InProceedings{alonso_et_al:LIPIcs.SoCG.2024.6,
  author =	{Alonso, \'{A}ngel Javier and Kerber, Michael and Skraba, Primoz},
  title =	{{Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{6:1--6:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.6},
  URN =		{urn:nbn:de:0030-drops-199510},
  doi =		{10.4230/LIPIcs.SoCG.2024.6},
  annote =	{Keywords: Topological Data Analysis, Multi-Parameter Persistence, Decomposition of persistence modules, Poisson point processes}
}
@InProceedings{an_et_al:LIPIcs.SoCG.2024.7,
  author =	{An, Shinwoo and Oh, Eunjin},
  title =	{{ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{7:1--7:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.7},
  URN =		{urn:nbn:de:0030-drops-199522},
  doi =		{10.4230/LIPIcs.SoCG.2024.7},
  annote =	{Keywords: Unit disk graphs, cycle packing, tree decomposition, parameterized algorithm}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2024.8,
  author =	{Aronov, Boris and Basit, Abdul and Ramesh, Indu and Tasinato, Gianluca and Wagner, Uli},
  title =	{{Eight-Partitioning Points in 3D, and Efficiently Too}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{8:1--8:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.8},
  URN =		{urn:nbn:de:0030-drops-199538},
  doi =		{10.4230/LIPIcs.SoCG.2024.8},
  annote =	{Keywords: Mass partitions, partitions of points in three dimensions, Borsuk-Ulam Theorem, Ham-Sandwich Theorem}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2024.9,
  author =	{Aronov, Boris and de Berg, Mark and Theocharous, Leonidas},
  title =	{{A Clique-Based Separator for Intersection Graphs of Geodesic Disks in \mathbb{R}²}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{9:1--9:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.9},
  URN =		{urn:nbn:de:0030-drops-199540},
  doi =		{10.4230/LIPIcs.SoCG.2024.9},
  annote =	{Keywords: Computational geometry, intersection graphs, separator theorems}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2024.10,
  author =	{Aronov, Boris and Farhana, Tsuri and Katz, Matthew J. and Ramesh, Indu},
  title =	{{Discrete Fr\'{e}chet Distance Oracles}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.10},
  URN =		{urn:nbn:de:0030-drops-199554},
  doi =		{10.4230/LIPIcs.SoCG.2024.10},
  annote =	{Keywords: discrete Fr\'{e}chet distance, distance oracle, heavy-path decomposition, t-local graphs}
}
@InProceedings{attali_et_al:LIPIcs.SoCG.2024.11,
  author =	{Attali, Dominique and Dal Poz Kou\v{r}imsk\'{a}, Hana and Fillmore, Christopher and Ghosh, Ishika and Lieutier, Andr\'{e} and Stephenson, Elizabeth and Wintraecken, Mathijs},
  title =	{{Tight Bounds for the Learning of Homotopy \`{a} la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{11:1--11:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.11},
  URN =		{urn:nbn:de:0030-drops-199565},
  doi =		{10.4230/LIPIcs.SoCG.2024.11},
  annote =	{Keywords: Homotopy, Inference, Sets of positive reach}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2024.12,
  author =	{Bandyapadhyay, Sayan and Xue, Jie},
  title =	{{An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{12:1--12:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.12},
  URN =		{urn:nbn:de:0030-drops-199577},
  doi =		{10.4230/LIPIcs.SoCG.2024.12},
  annote =	{Keywords: many-to-many matching, geometric optimization, approximation algorithms}
}
@InProceedings{barkan_et_al:LIPIcs.SoCG.2024.13,
  author =	{Barkan, Willow and Bennett, Huck and Nayyeri, Amir},
  title =	{{Topological k-Metrics}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{13:1--13:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.13},
  URN =		{urn:nbn:de:0030-drops-199585},
  doi =		{10.4230/LIPIcs.SoCG.2024.13},
  annote =	{Keywords: k-metrics, metric embeddings, computational topology, simplicial complexes}
}
@InProceedings{basilio_et_al:LIPIcs.SoCG.2024.14,
  author =	{Basilio, Brannon and Lee, Chaeryn and Malionek, Joseph},
  title =	{{Totally Geodesic Surfaces in Hyperbolic 3-Manifolds: Algorithms and Examples}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{14:1--14:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.14},
  URN =		{urn:nbn:de:0030-drops-199593},
  doi =		{10.4230/LIPIcs.SoCG.2024.14},
  annote =	{Keywords: totally geodesic, Fuchsian group, hyperbolic, knot complement, computational topology, low-dimensional topology}
}
@InProceedings{bauer_et_al:LIPIcs.SoCG.2024.15,
  author =	{Bauer, Ulrich and Roll, Fabian},
  title =	{{Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{15:1--15:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.15},
  URN =		{urn:nbn:de:0030-drops-199600},
  doi =		{10.4230/LIPIcs.SoCG.2024.15},
  annote =	{Keywords: persistent homology, discrete Morse theory, apparent pairs, Wrap complex, lexicographic optimal chains, shape reconstruction}
}
@InProceedings{deberg_et_al:LIPIcs.SoCG.2024.16,
  author =	{de Berg, Mark and Theocharous, Leonidas},
  title =	{{A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{16:1--16:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.16},
  URN =		{urn:nbn:de:0030-drops-199613},
  doi =		{10.4230/LIPIcs.SoCG.2024.16},
  annote =	{Keywords: Furthest-neighbor queries, polygons, geodesic distance, coreset}
}
@InProceedings{deberg_et_al:LIPIcs.SoCG.2024.17,
  author =	{de Berg, Sarita and Miltzow, Tillmann and Staals, Frank},
  title =	{{Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{17:1--17:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.17},
  URN =		{urn:nbn:de:0030-drops-199628},
  doi =		{10.4230/LIPIcs.SoCG.2024.17},
  annote =	{Keywords: data structure, polygonal domain, geodesic distance}
}
@InProceedings{bergold_et_al:LIPIcs.SoCG.2024.18,
  author =	{Bergold, Helena and Felsner, Stefan and M. Reddy, Meghana and Orthaber, Joachim and Scheucher, Manfred},
  title =	{{Plane Hamiltonian Cycles in Convex Drawings}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{18:1--18:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.18},
  URN =		{urn:nbn:de:0030-drops-199630},
  doi =		{10.4230/LIPIcs.SoCG.2024.18},
  annote =	{Keywords: simple drawing, convexity hierarchy, plane pancyclicity, plane Hamiltonian connectivity, maximal plane subdrawing}
}
@InProceedings{bhore_et_al:LIPIcs.SoCG.2024.19,
  author =	{Bhore, Sujoy and N\"{o}llenburg, Martin and T\'{o}th, Csaba D. and Wulms, Jules},
  title =	{{Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{19:1--19:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.19},
  URN =		{urn:nbn:de:0030-drops-199649},
  doi =		{10.4230/LIPIcs.SoCG.2024.19},
  annote =	{Keywords: Dynamic algorithm, Independent set, Geometric intersection graph}
}
@InProceedings{blazej_et_al:LIPIcs.SoCG.2024.20,
  author =	{Bla\v{z}ej, V\'{a}clav and Klemz, Boris and Klesen, Felix and Sieper, Marie Diana and Wolff, Alexander and Zink, Johannes},
  title =	{{Constrained and Ordered Level Planarity Parameterized by the Number of Levels}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{20:1--20:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.20},
  URN =		{urn:nbn:de:0030-drops-199652},
  doi =		{10.4230/LIPIcs.SoCG.2024.20},
  annote =	{Keywords: Parameterized Complexity, Graph Drawing, XNLP, XP, W\lbrackt\rbrack-hard, Level Planarity, Planar Poset Diagram, Computational Geometry}
}
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2024.21,
  author =	{Boissonnat, Jean-Daniel and Dutta, Kunal and Dutta, Soumik and Pritam, Siddharth},
  title =	{{On Edge Collapse of Random Simplicial Complexes}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{21:1--21:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.21},
  URN =		{urn:nbn:de:0030-drops-199661},
  doi =		{10.4230/LIPIcs.SoCG.2024.21},
  annote =	{Keywords: Computational Topology, Topological Data Analysis, Strong Collapse, Simple Collapse, Persistent homology, Random simplicial complexes}
}
@InProceedings{bousquet_et_al:LIPIcs.SoCG.2024.22,
  author =	{Bousquet, Nicolas and de Meyer, Lucas and Pierron, Th\'{e}o and Wesolek, Alexandra},
  title =	{{Reconfiguration of Plane Trees in Convex Geometric Graphs}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{22:1--22:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.22},
  URN =		{urn:nbn:de:0030-drops-199673},
  doi =		{10.4230/LIPIcs.SoCG.2024.22},
  annote =	{Keywords: Reconfiguration, Non-crossing trees, flip distance}
}
@InProceedings{bouvel_et_al:LIPIcs.SoCG.2024.23,
  author =	{Bouvel, Mathilde and Feray, Valentin and Goaoc, Xavier and Koechlin, Florent},
  title =	{{A Canonical Tree Decomposition for Chirotopes}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{23:1--23:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.23},
  URN =		{urn:nbn:de:0030-drops-199680},
  doi =		{10.4230/LIPIcs.SoCG.2024.23},
  annote =	{Keywords: Order type, modular decomposition, counting triangulations, mutually avoiding point sets, generating functions, rewriting systems}
}
@InProceedings{brewer_et_al:LIPIcs.SoCG.2024.24,
  author =	{Brewer, Bruce and Brodal, Gerth St{\o}lting and Wang, Haitao},
  title =	{{Dynamic Convex Hulls for Simple Paths}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{24:1--24:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.24},
  URN =		{urn:nbn:de:0030-drops-199699},
  doi =		{10.4230/LIPIcs.SoCG.2024.24},
  annote =	{Keywords: Dynamic convex hull, convex hull queries, simple paths, path updates, deque}
}
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2024.25,
  author =	{Bringmann, Karl and Staals, Frank and W\k{e}grzycki, Karol and van Wordragen, Geert},
  title =	{{Fine-Grained Complexity of Earth Mover’s Distance Under Translation}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{25:1--25:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.25},
  URN =		{urn:nbn:de:0030-drops-199706},
  doi =		{10.4230/LIPIcs.SoCG.2024.25},
  annote =	{Keywords: Earth Mover’s Distance, Earth Mover’s Distance under Translation, Fine-Grained Complexity, Maximum Weight Bipartite Matching}
}
@InProceedings{buchem_et_al:LIPIcs.SoCG.2024.26,
  author =	{Buchem, Moritz and Deuker, Paul and Wiese, Andreas},
  title =	{{Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{26:1--26:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.26},
  URN =		{urn:nbn:de:0030-drops-199716},
  doi =		{10.4230/LIPIcs.SoCG.2024.26},
  annote =	{Keywords: Geometric packing, approximation algorithms, dynamic algorithms}
}
@InProceedings{buchin_et_al:LIPIcs.SoCG.2024.27,
  author =	{Buchin, Kevin and Buchin, Maike and Gudmundsson, Joachim and Popov, Aleksandr and Wong, Sampson},
  title =	{{Map-Matching Queries Under Fr\'{e}chet Distance on Low-Density Spanners}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{27:1--27:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.27},
  URN =		{urn:nbn:de:0030-drops-199723},
  doi =		{10.4230/LIPIcs.SoCG.2024.27},
  annote =	{Keywords: Map Matching, Fr\'{e}chet Distance, Data Structures}
}
@InProceedings{bulavka_et_al:LIPIcs.SoCG.2024.28,
  author =	{Bulavka, Denys and Colin de Verdi\`{e}re, \'{E}ric and Fuladi, Niloufar},
  title =	{{Computing Shortest Closed Curves on Non-Orientable Surfaces}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{28:1--28:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.28},
  URN =		{urn:nbn:de:0030-drops-199731},
  doi =		{10.4230/LIPIcs.SoCG.2024.28},
  annote =	{Keywords: Surface, Graph, Algorithm, Non-orientable surface}
}
@InProceedings{burke:LIPIcs.SoCG.2024.29,
  author =	{Burke, Rhuaidi Antonio},
  title =	{{Practical Software for Triangulating and Simplifying 4-Manifolds}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{29:1--29:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.29},
  URN =		{urn:nbn:de:0030-drops-199748},
  doi =		{10.4230/LIPIcs.SoCG.2024.29},
  annote =	{Keywords: computational low-dimensional topology, triangulations, 4-manifolds, exotic 4-manifolds, mathematical software, experiments in low-dimensional topology}
}
@InProceedings{burton_et_al:LIPIcs.SoCG.2024.30,
  author =	{Burton, Benjamin A. and Thompson, Finn},
  title =	{{Effective Computation of the Heegaard Genus of 3-Manifolds}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{30:1--30:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.30},
  URN =		{urn:nbn:de:0030-drops-199750},
  doi =		{10.4230/LIPIcs.SoCG.2024.30},
  annote =	{Keywords: 3-manifolds, triangulations, normal surfaces, computational topology, Heegaard genus}
}
@InProceedings{cabello_et_al:LIPIcs.SoCG.2024.31,
  author =	{Cabello, Sergio and Cheng, Siu-Wing and Cheong, Otfried and Knauer, Christian},
  title =	{{Geometric Matching and Bottleneck Problems}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{31:1--31:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.31},
  URN =		{urn:nbn:de:0030-drops-199768},
  doi =		{10.4230/LIPIcs.SoCG.2024.31},
  annote =	{Keywords: Many-to-many matching, bipartite, planar, geometric, approximation}
}
@InProceedings{castellialeardi_et_al:LIPIcs.SoCG.2024.32,
  author =	{Castelli Aleardi, Luca and Devillers, Olivier},
  title =	{{SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data Structure}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{32:1--32:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.32},
  URN =		{urn:nbn:de:0030-drops-199779},
  doi =		{10.4230/LIPIcs.SoCG.2024.32},
  annote =	{Keywords: Meshes, compression, triangulations, compact representations}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2024.33,
  author =	{Chan, Timothy M. and Cheng, Pingan and Zheng, Da Wei},
  title =	{{Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{33:1--33:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.33},
  URN =		{urn:nbn:de:0030-drops-199785},
  doi =		{10.4230/LIPIcs.SoCG.2024.33},
  annote =	{Keywords: Computational geometry, range searching, intersection searching, semialgebraic sets, data structures, polynomial partitioning}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2024.34,
  author =	{Chan, Timothy M. and Hair, Isaac M.},
  title =	{{Convex Polygon Containment: Improving Quadratic to Near Linear Time}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{34:1--34:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.34},
  URN =		{urn:nbn:de:0030-drops-199795},
  doi =		{10.4230/LIPIcs.SoCG.2024.34},
  annote =	{Keywords: Polygon containment, convex polygons, translations, rotations}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2024.35,
  author =	{Chan, Timothy M. and He, Qizheng and Xue, Jie},
  title =	{{Enclosing Points with Geometric Objects}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{35:1--35:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.35},
  URN =		{urn:nbn:de:0030-drops-199802},
  doi =		{10.4230/LIPIcs.SoCG.2024.35},
  annote =	{Keywords: obstacle placement, geometric optimization, approximation algorithms}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2024.36,
  author =	{Chan, Timothy M. and Huang, Zhengcheng},
  title =	{{Dynamic Geometric Connectivity in the Plane with Constant Query Time}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{36:1--36:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.36},
  URN =		{urn:nbn:de:0030-drops-199819},
  doi =		{10.4230/LIPIcs.SoCG.2024.36},
  annote =	{Keywords: Connectivity, dynamic data structures, geometric intersection graphs}
}
@InProceedings{chang_et_al:LIPIcs.SoCG.2024.37,
  author =	{Chang, Hsien-Chih and Conroy, Jonathan and Le, Hung and Milenkovi\'{c}, Lazar and Solomon, Shay and Than, Cuong},
  title =	{{Optimal Euclidean Tree Covers}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{37:1--37:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.37},
  URN =		{urn:nbn:de:0030-drops-199828},
  doi =		{10.4230/LIPIcs.SoCG.2024.37},
  annote =	{Keywords: Tree cover, spanner, Steiner point, routing, bounded-degree, quadtree, net-tree}
}
@InProceedings{chang_et_al:LIPIcs.SoCG.2024.38,
  author =	{Chang, Hsien-Chih and Gao, Jie and Le, Hung},
  title =	{{Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{38:1--38:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.38},
  URN =		{urn:nbn:de:0030-drops-199833},
  doi =		{10.4230/LIPIcs.SoCG.2024.38},
  annote =	{Keywords: Unit-disk graph, pseudo-disks, r-division, VC-dimension, distance oracle, clique-based separator}
}
@InProceedings{chawin_et_al:LIPIcs.SoCG.2024.39,
  author =	{Chawin, Dror and Haviv, Ishay},
  title =	{{Nearly Orthogonal Sets over Finite Fields}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{39:1--39:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.39},
  URN =		{urn:nbn:de:0030-drops-199848},
  doi =		{10.4230/LIPIcs.SoCG.2024.39},
  annote =	{Keywords: Nearly orthogonal sets, Finite fields}
}
@InProceedings{cho_et_al:LIPIcs.SoCG.2024.40,
  author =	{Cho, Kyungjin and Oh, Eunjin and Wang, Haitao and Xue, Jie},
  title =	{{Optimal Algorithm for the Planar Two-Center Problem}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{40:1--40:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.40},
  URN =		{urn:nbn:de:0030-drops-199857},
  doi =		{10.4230/LIPIcs.SoCG.2024.40},
  annote =	{Keywords: two-center, r-coverage, disk coverage, circular hulls}
}
@InProceedings{choi_et_al:LIPIcs.SoCG.2024.41,
  author =	{Choi, Suyoung and Jang, Hyeontae and Vall\'{e}e, Mathieu},
  title =	{{GPU Algorithm for Enumerating PL Spheres of Picard Number 4: Application to Toric Topology}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{41:1--41:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.41},
  URN =		{urn:nbn:de:0030-drops-199864},
  doi =		{10.4230/LIPIcs.SoCG.2024.41},
  annote =	{Keywords: PL sphere, simplicial sphere, toric manifold, Picard number, weak pseudo-manifold, characteristic map, binary matroid, parallel computing, GPU programming}
}
@InProceedings{conradi_et_al:LIPIcs.SoCG.2024.42,
  author =	{Conradi, Jacobus and Kolbe, Benedikt and Psarros, Ioannis and Rohde, Dennis},
  title =	{{Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{42:1--42:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.42},
  URN =		{urn:nbn:de:0030-drops-199875},
  doi =		{10.4230/LIPIcs.SoCG.2024.42},
  annote =	{Keywords: Dynamic time warping, coreset, median clustering, approximation algorithm}
}
@InProceedings{corteskuhnast_et_al:LIPIcs.SoCG.2024.43,
  author =	{Cort\'{e}s K\"{u}hnast, Fernando and Dallant, Justin and Felsner, Stefan and Scheucher, Manfred},
  title =	{{An Improved Lower Bound on the Number of Pseudoline Arrangements}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{43:1--43:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.43},
  URN =		{urn:nbn:de:0030-drops-199880},
  doi =		{10.4230/LIPIcs.SoCG.2024.43},
  annote =	{Keywords: counting, pseudoline arrangement, recursive construction, bipermutation, divide and conquer, dynamic programming, computer-assisted proof}
}
@InProceedings{curry_et_al:LIPIcs.SoCG.2024.44,
  author =	{Curry, Justin and Mio, Washington and Needham, Tom and Okutan, Osman Berat and Russold, Florian},
  title =	{{Stability and Approximations for Decorated Reeb Spaces}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{44:1--44:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.44},
  URN =		{urn:nbn:de:0030-drops-199891},
  doi =		{10.4230/LIPIcs.SoCG.2024.44},
  annote =	{Keywords: Reeb spaces, Gromov-Hausdorff distance, Persistent homology}
}
@InProceedings{dalal_et_al:LIPIcs.SoCG.2024.45,
  author =	{Dalal, Suryendu and Gangopadhyay, Rahul and Raman, Rajiv and Ray, Saurabh},
  title =	{{Sweeping Arrangements of Non-Piercing Regions in the Plane}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{45:1--45:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.45},
  URN =		{urn:nbn:de:0030-drops-199900},
  doi =		{10.4230/LIPIcs.SoCG.2024.45},
  annote =	{Keywords: Sweeping, Pseudodisks, Discrete Geometry, Topology}
}
@InProceedings{damasdi_et_al:LIPIcs.SoCG.2024.46,
  author =	{Dam\'{a}sdi, G\'{a}bor and Dong, Zichao and Scheucher, Manfred and Zeng, Ji},
  title =	{{Saturation Results Around the Erd\H{o}s-Szekeres Problem}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{46:1--46:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.46},
  URN =		{urn:nbn:de:0030-drops-199919},
  doi =		{10.4230/LIPIcs.SoCG.2024.46},
  annote =	{Keywords: Convex polygon, Cups-versus-caps, Monotone path, Saturation problem}
}
@InProceedings{das_et_al:LIPIcs.SoCG.2024.47,
  author =	{Das, Rathish and Filtser, Omrit and Katz, Matthew J. and Mitchell, Joseph S.B.},
  title =	{{Robustly Guarding Polygons}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{47:1--47:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.47},
  URN =		{urn:nbn:de:0030-drops-199928},
  doi =		{10.4230/LIPIcs.SoCG.2024.47},
  annote =	{Keywords: geometric optimization, approximation algorithms, guarding}
}
@InProceedings{dehornoy_et_al:LIPIcs.SoCG.2024.48,
  author =	{Dehornoy, Pierre and Lunel, Corentin and de Mesmay, Arnaud},
  title =	{{Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{48:1--48:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.48},
  URN =		{urn:nbn:de:0030-drops-199938},
  doi =		{10.4230/LIPIcs.SoCG.2024.48},
  annote =	{Keywords: Knot Theory, Genus, Slice Genus, Hopf Arborescent Links, Well-Quasi-Order}
}
@InProceedings{dey_et_al:LIPIcs.SoCG.2024.49,
  author =	{Dey, Tamal K. and Hou, Tao},
  title =	{{Computing Zigzag Vineyard Efficiently Including Expansions and Contractions}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{49:1--49:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.49},
  URN =		{urn:nbn:de:0030-drops-199942},
  doi =		{10.4230/LIPIcs.SoCG.2024.49},
  annote =	{Keywords: zigzag persistence, vines and vineyard, update operations}
}
@InProceedings{dey_et_al:LIPIcs.SoCG.2024.50,
  author =	{Dey, Tamal K. and Rathod, Abhishek},
  title =	{{Cup Product Persistence and Its Efficient Computation}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{50:1--50:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.50},
  URN =		{urn:nbn:de:0030-drops-199958},
  doi =		{10.4230/LIPIcs.SoCG.2024.50},
  annote =	{Keywords: Persistent cohomology, cup product, image persistence, persistent cup module}
}
@InProceedings{dey_et_al:LIPIcs.SoCG.2024.51,
  author =	{Dey, Tamal K. and Russold, Florian and Samaga, Shreyas N.},
  title =	{{Efficient Algorithms for Complexes of Persistence Modules with Applications}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{51:1--51:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.51},
  URN =		{urn:nbn:de:0030-drops-199969},
  doi =		{10.4230/LIPIcs.SoCG.2024.51},
  annote =	{Keywords: Persistent (co)homology, Persistence modules, Sheaves, Presentations}
}
@InProceedings{dobbins_et_al:LIPIcs.SoCG.2024.52,
  author =	{Dobbins, Michael Gene and Holmsen, Andreas F. and Lee, Dohyeon},
  title =	{{Colorful Intersections and Tverberg Partitions}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{52:1--52:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.52},
  URN =		{urn:nbn:de:0030-drops-199973},
  doi =		{10.4230/LIPIcs.SoCG.2024.52},
  annote =	{Keywords: Tverberg’s theorem, geometric transversals, topological combinatorics, configuration space/test map, discrete Morse theory}
}
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2024.53,
  author =	{Edelsbrunner, Herbert and Pach, J\'{a}nos},
  title =	{{Maximum Betti Numbers of \v{C}ech Complexes}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{53:1--53:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.53},
  URN =		{urn:nbn:de:0030-drops-199981},
  doi =		{10.4230/LIPIcs.SoCG.2024.53},
  annote =	{Keywords: Discrete geometry, computational topology, \v{C}ech complexes, Delaunay mosaics, Alpha complexes, Betti numbers, extremal questions}
}
@InProceedings{eisenbrand_et_al:LIPIcs.SoCG.2024.54,
  author =	{Eisenbrand, Friedrich and Haeberle, Matthieu and Singer, Neta},
  title =	{{An Improved Bound on Sums of Square Roots via the Subspace Theorem}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{54:1--54:8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.54},
  URN =		{urn:nbn:de:0030-drops-199993},
  doi =		{10.4230/LIPIcs.SoCG.2024.54},
  annote =	{Keywords: Exact computing, Separation Bounds, Computational Geometry, Geometry of Numbers}
}
@InProceedings{eskenazis:LIPIcs.SoCG.2024.55,
  author =	{Eskenazis, Alexandros},
  title =	{{Dimensionality of Hamming Metrics and Rademacher Type}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{55:1--55:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.55},
  URN =		{urn:nbn:de:0030-drops-200004},
  doi =		{10.4230/LIPIcs.SoCG.2024.55},
  annote =	{Keywords: Hamming cube, Rademacher type, metric embeddings, Borsuk-Ulam theorem}
}
@InProceedings{filtser_et_al:LIPIcs.SoCG.2024.56,
  author =	{Filtser, Arnold and Gitlitz, Yuval and Neiman, Ofer},
  title =	{{Light, Reliable Spanners}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{56:1--56:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.56},
  URN =		{urn:nbn:de:0030-drops-200019},
  doi =		{10.4230/LIPIcs.SoCG.2024.56},
  annote =	{Keywords: light spanner, reliable spanner, HST cover, doubling metric, minor free graphs}
}
@InProceedings{focke_et_al:LIPIcs.SoCG.2024.57,
  author =	{Focke, Jacob and H\"{o}rsch, Florian and Li, Shaohua and Marx, D\'{a}niel},
  title =	{{Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{57:1--57:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.57},
  URN =		{urn:nbn:de:0030-drops-200021},
  doi =		{10.4230/LIPIcs.SoCG.2024.57},
  annote =	{Keywords: MultiCut, Multiway Cut, Parameterized Complexity, Tight Bounds, Embedded Graph, Planar Graph, Genus, Surface, Exponential Time Hypothesis}
}
@InProceedings{fox_et_al:LIPIcs.SoCG.2024.58,
  author =	{Fox, Emily and Nayyeri, Amir and Perry, Jonathan James and Raichel, Benjamin},
  title =	{{Fr\'{e}chet Edit Distance}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{58:1--58:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.58},
  URN =		{urn:nbn:de:0030-drops-200032},
  doi =		{10.4230/LIPIcs.SoCG.2024.58},
  annote =	{Keywords: Fr\'{e}chet distance, Edit distance, Hardness}
}
@InProceedings{fox_et_al:LIPIcs.SoCG.2024.59,
  author =	{Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew},
  title =	{{A Structure Theorem for Pseudo-Segments and Its Applications}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{59:1--59:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.59},
  URN =		{urn:nbn:de:0030-drops-200040},
  doi =		{10.4230/LIPIcs.SoCG.2024.59},
  annote =	{Keywords: Regularity lemma, pseudo-segments, intersection graphs}
}
@InProceedings{gao_et_al:LIPIcs.SoCG.2024.60,
  author =	{Gao, Zhimeng and Har-Peled, Sariel},
  title =	{{Near Optimal Locality Sensitive Orderings in Euclidean Space}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{60:1--60:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.60},
  URN =		{urn:nbn:de:0030-drops-200053},
  doi =		{10.4230/LIPIcs.SoCG.2024.60},
  annote =	{Keywords: Orderings, approximation}
}
@InProceedings{grandoni_et_al:LIPIcs.SoCG.2024.61,
  author =	{Grandoni, Fabrizio and Husi\'{c}, Edin and Mari, Mathieu and Tinguely, Antoine},
  title =	{{Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{61:1--61:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.61},
  URN =		{urn:nbn:de:0030-drops-200066},
  doi =		{10.4230/LIPIcs.SoCG.2024.61},
  annote =	{Keywords: Approximation algorithms, packing, independent set, polygons}
}
@InProceedings{gudmundsson_et_al:LIPIcs.SoCG.2024.62,
  author =	{Gudmundsson, Joachim and Seybold, Martin P. and Wong, Sampson},
  title =	{{Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{62:1--62:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.62},
  URN =		{urn:nbn:de:0030-drops-200078},
  doi =		{10.4230/LIPIcs.SoCG.2024.62},
  annote =	{Keywords: Multiplicatively Weighted Voronoi Diagram, Compressed QuadTree, Adaptive Refinement, Bisector Coresets, Semi-Separated Pair Decomposition, Lower Bound}
}
@InProceedings{vanderhorst_et_al:LIPIcs.SoCG.2024.63,
  author =	{van der Horst, Thijs and Ophelders, Tim},
  title =	{{Faster Fr\'{e}chet Distance Approximation Through Truncated Smoothing}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{63:1--63:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.63},
  URN =		{urn:nbn:de:0030-drops-200083},
  doi =		{10.4230/LIPIcs.SoCG.2024.63},
  annote =	{Keywords: Fr\'{e}cht distance, approximation algorithms, simplification}
}
@InProceedings{jiang_et_al:LIPIcs.SoCG.2024.64,
  author =	{Jiang, Shaofeng H.-C. and Krauthgamer, Robert and Sapir, Shay},
  title =	{{Moderate Dimension Reduction for k-Center Clustering}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{64:1--64:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.64},
  URN =		{urn:nbn:de:0030-drops-200095},
  doi =		{10.4230/LIPIcs.SoCG.2024.64},
  annote =	{Keywords: Johnson-Lindenstrauss transform, dimension reduction, clustering, streaming algorithms}
}
@InProceedings{kanj_et_al:LIPIcs.SoCG.2024.65,
  author =	{Kanj, Iyad and Parsa, Salman},
  title =	{{On the Parameterized Complexity of Motion Planning for Rectangular Robots}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{65:1--65:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.65},
  URN =		{urn:nbn:de:0030-drops-200108},
  doi =		{10.4230/LIPIcs.SoCG.2024.65},
  annote =	{Keywords: motion planning of rectangular robots, coordinated motion planing of rectangular robots, parameterized complexity}
}
@InProceedings{keller_et_al:LIPIcs.SoCG.2024.66,
  author =	{Keller, Chaya and Smorodinsky, Shakhar},
  title =	{{Zarankiewicz’s Problem via \epsilon-t-Nets}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{66:1--66:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.66},
  URN =		{urn:nbn:de:0030-drops-200111},
  doi =		{10.4230/LIPIcs.SoCG.2024.66},
  annote =	{Keywords: Zarankiewicz’s Problem, \epsilon-t-nets, pseudo-discs, VC-dimension}
}
@InProceedings{kisfaludibak_et_al:LIPIcs.SoCG.2024.67,
  author =	{Kisfaludi-Bak, S\'{a}ndor and Masa\v{r}{\'\i}kov\'{a}, Jana and van Leeuwen, Erik Jan and Walczak, Bartosz and W\k{e}grzycki, Karol},
  title =	{{Separator Theorem and Algorithms for Planar Hyperbolic Graphs}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{67:1--67:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.67},
  URN =		{urn:nbn:de:0030-drops-200126},
  doi =		{10.4230/LIPIcs.SoCG.2024.67},
  annote =	{Keywords: Hyperbolic metric, Planar Graphs, r-Division, Approximation Algorithms}
}
@InProceedings{kisfaludibak_et_al:LIPIcs.SoCG.2024.68,
  author =	{Kisfaludi-Bak, S\'{a}ndor and van Wordragen, Geert},
  title =	{{A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{68:1--68:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.68},
  URN =		{urn:nbn:de:0030-drops-200133},
  doi =		{10.4230/LIPIcs.SoCG.2024.68},
  annote =	{Keywords: hyperbolic geometry, Steiner spanner, dynamic approximate nearest neighbours}
}
@InProceedings{dalpozkourimska_et_al:LIPIcs.SoCG.2024.69,
  author =	{Dal Poz Kou\v{r}imsk\'{a}, Hana and Lieutier, Andr\'{e} and Wintraecken, Mathijs},
  title =	{{The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{69:1--69:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.69},
  URN =		{urn:nbn:de:0030-drops-200149},
  doi =		{10.4230/LIPIcs.SoCG.2024.69},
  annote =	{Keywords: Medial axis, Hausdorff distance, Lipschitz continuity}
}
@InProceedings{lim:LIPIcs.SoCG.2024.70,
  author =	{Lim, Uzu},
  title =	{{Strange Random Topology of the Circle}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{70:1--70:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.70},
  URN =		{urn:nbn:de:0030-drops-200150},
  doi =		{10.4230/LIPIcs.SoCG.2024.70},
  annote =	{Keywords: Topological data analysis, persistent homology, stochastic topology}
}
@InProceedings{liu_et_al:LIPIcs.SoCG.2024.71,
  author =	{Liu, Hong and Shangguan, Chong and Skokan, Jozef and Xu, Zixiang},
  title =	{{Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{71:1--71:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.71},
  URN =		{urn:nbn:de:0030-drops-200162},
  doi =		{10.4230/LIPIcs.SoCG.2024.71},
  annote =	{Keywords: (p,q)-theorem, fractional Helly number, weak \epsilon-net, chromatic threshold, VC dimension}
}
@InProceedings{lokshtanov_et_al:LIPIcs.SoCG.2024.72,
  author =	{Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket and Xue, Jie and Zehavi, Meirav},
  title =	{{A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{72:1--72:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.72},
  URN =		{urn:nbn:de:0030-drops-200174},
  doi =		{10.4230/LIPIcs.SoCG.2024.72},
  annote =	{Keywords: vertex cover, geometric intersection graphs, approximation algorithms}
}
@InProceedings{majhi:LIPIcs.SoCG.2024.73,
  author =	{Majhi, Sushovan},
  title =	{{Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{73:1--73:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.73},
  URN =		{urn:nbn:de:0030-drops-200188},
  doi =		{10.4230/LIPIcs.SoCG.2024.73},
  annote =	{Keywords: Vietoris-Rips complex, submanifold reconstruction, manifold reconstruction, Latschev’s theorem, homotopy Equivalence}
}
@InProceedings{planken_et_al:LIPIcs.SoCG.2024.74,
  author =	{Planken, Tim and Ueckerdt, Torsten},
  title =	{{Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{74:1--74:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.74},
  URN =		{urn:nbn:de:0030-drops-200199},
  doi =		{10.4230/LIPIcs.SoCG.2024.74},
  annote =	{Keywords: geometric hypergraphs, range spaces, polychromatic coloring, shallow hitting sets}
}
@InProceedings{reani_et_al:LIPIcs.SoCG.2024.75,
  author =	{Reani, Yohai and Bobrowski, Omer},
  title =	{{Morse Theory for the k-NN Distance Function}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{75:1--75:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.75},
  URN =		{urn:nbn:de:0030-drops-200202},
  doi =		{10.4230/LIPIcs.SoCG.2024.75},
  annote =	{Keywords: Applied topology, Morse theory, Distance function, k-nearest neighbor}
}
@InProceedings{rote_et_al:LIPIcs.SoCG.2024.76,
  author =	{Rote, G\"{u}nter and R\"{u}ber, Moritz and Saghafian, Morteza},
  title =	{{Grid Peeling of Parabolas}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{76:1--76:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.76},
  URN =		{urn:nbn:de:0030-drops-200213},
  doi =		{10.4230/LIPIcs.SoCG.2024.76},
  annote =	{Keywords: grid polygons, curvature flow}
}
@InProceedings{schnider_et_al:LIPIcs.SoCG.2024.77,
  author =	{Schnider, Patrick and Weber, Simon},
  title =	{{A Topological Version of Schaefer’s Dichotomy Theorem}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{77:1--77:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.77},
  URN =		{urn:nbn:de:0030-drops-200220},
  doi =		{10.4230/LIPIcs.SoCG.2024.77},
  annote =	{Keywords: Computational topology, Boolean CSP, satisfiability, computational complexity, solution space, homotopy universality, homological connectivity}
}
@InProceedings{tancer:LIPIcs.SoCG.2024.78,
  author =	{Tancer, Martin},
  title =	{{Pach’s Animal Problem Within the Bounding Box}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{78:1--78:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.78},
  URN =		{urn:nbn:de:0030-drops-200234},
  doi =		{10.4230/LIPIcs.SoCG.2024.78},
  annote =	{Keywords: Animal problem, bounding box, non-shellable balls}
}
@InProceedings{wang_et_al:LIPIcs.SoCG.2024.79,
  author =	{Wang, Haitao and Xue, Jie},
  title =	{{Algorithms for Halfplane Coverage and Related Problems}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{79:1--79:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.79},
  URN =		{urn:nbn:de:0030-drops-200248},
  doi =		{10.4230/LIPIcs.SoCG.2024.79},
  annote =	{Keywords: halfplane coverage, circular coverage, star-shaped polygon coverage, \epsilon-kernels}
}
@InProceedings{wang_et_al:LIPIcs.SoCG.2024.80,
  author =	{Wang, Qingsong and Ma, Guanqun and Sridharamurthy, Raghavendra and Wang, Bei},
  title =	{{Measure-Theoretic Reeb Graphs and Reeb Spaces}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{80:1--80:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.80},
  URN =		{urn:nbn:de:0030-drops-200257},
  doi =		{10.4230/LIPIcs.SoCG.2024.80},
  annote =	{Keywords: Reeb graph, Reeb space, metric measure space, topological data analysis}
}
@InProceedings{vanwijland_et_al:LIPIcs.SoCG.2024.81,
  author =	{van Wijland, Ernest and Zhou, Hang},
  title =	{{Faster Approximation Scheme for Euclidean k-TSP}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{81:1--81:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.81},
  URN =		{urn:nbn:de:0030-drops-200268},
  doi =		{10.4230/LIPIcs.SoCG.2024.81},
  annote =	{Keywords: approximation algorithms, optimization, traveling salesman problem}
}
@InProceedings{zhu_et_al:LIPIcs.SoCG.2024.82,
  author =	{Zhu, Xiaoyi and Tian, Yuxiang and Huang, Lingxiao and Huang, Zengfeng},
  title =	{{Space Complexity of Euclidean Clustering}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{82:1--82:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.82},
  URN =		{urn:nbn:de:0030-drops-200279},
  doi =		{10.4230/LIPIcs.SoCG.2024.82},
  annote =	{Keywords: Space complexity, Euclidean clustering, coreset, terminal embedding}
}
@InProceedings{atak_et_al:LIPIcs.SoCG.2024.83,
  author =	{Atak, Alkan and Buchin, Kevin and Hagedoorn, Mart and Heinrichs, Jona and Hogreve, Karsten and Li, Guangping and Pawelczyk, Patrick},
  title =	{{Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{83:1--83:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.83},
  URN =		{urn:nbn:de:0030-drops-200283},
  doi =		{10.4230/LIPIcs.SoCG.2024.83},
  annote =	{Keywords: Polygon Packing, Nesting Problem, Genetic Algorithm, Integer Linear Programming}
}
@InProceedings{dafonseca_et_al:LIPIcs.SoCG.2024.84,
  author =	{da Fonseca, Guilherme D. and Gerard, Yan},
  title =	{{Shadoks Approach to Knapsack Polygonal Packing}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{84:1--84:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.84},
  URN =		{urn:nbn:de:0030-drops-200293},
  doi =		{10.4230/LIPIcs.SoCG.2024.84},
  annote =	{Keywords: Packing, polygons, heuristics, integer programming, computational geometry}
}
@InProceedings{held:LIPIcs.SoCG.2024.85,
  author =	{Held, Martin},
  title =	{{Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{85:1--85:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.85},
  URN =		{urn:nbn:de:0030-drops-200306},
  doi =		{10.4230/LIPIcs.SoCG.2024.85},
  annote =	{Keywords: Computational Geometry, geometric optimization, nesting, packing, algorithm engineering}
}
@InProceedings{luo_et_al:LIPIcs.SoCG.2024.86,
  author =	{Luo, Canhui and Su, Zhouxing and L\"{u}, Zhipeng},
  title =	{{A General Heuristic Approach for Maximum Polygon Packing}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{86:1--86:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.86},
  URN =		{urn:nbn:de:0030-drops-200315},
  doi =		{10.4230/LIPIcs.SoCG.2024.86},
  annote =	{Keywords: packing, polygon, heuristic, differential evolution, local search, tabu search}
}
@InProceedings{attali_et_al:LIPIcs.SoCG.2024.87,
  author =	{Attali, Dominique and Dal Poz Kou\v{r}imsk\'{a}, Hana and Fillmore, Christopher and Ghosh, Ishika and Lieutier, Andr\'{e} and Stephenson, Elizabeth and Wintraecken, Mathijs},
  title =	{{The Ultimate Frontier: An Optimality Construction for Homotopy Inference}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{87:1--87:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.87},
  URN =		{urn:nbn:de:0030-drops-200325},
  doi =		{10.4230/LIPIcs.SoCG.2024.87},
  annote =	{Keywords: Homotopy, Inference, Sets of positive reach}
}
@InProceedings{haagsman_et_al:LIPIcs.SoCG.2024.88,
  author =	{Haagsman, Marjolein and L\"{o}ffler, Maarten and Wenk, Carola},
  title =	{{Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{88:1--88:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.88},
  URN =		{urn:nbn:de:0030-drops-200335},
  doi =		{10.4230/LIPIcs.SoCG.2024.88},
  annote =	{Keywords: Computational geometry concepts, videos, online education}
}
@InProceedings{kostitsyna_et_al:LIPIcs.SoCG.2024.89,
  author =	{Kostitsyna, Irina and Ophelders, Tim and Parada, Irene and Peters, Tom and Sonke, Willem and Speckmann, Bettina},
  title =	{{Optimal In-Place Compaction of Sliding Cubes}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{89:1--89:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.89},
  URN =		{urn:nbn:de:0030-drops-200347},
  doi =		{10.4230/LIPIcs.SoCG.2024.89},
  annote =	{Keywords: Sliding cubes, Reconfiguration algorithm, Modular robots}
}
@InProceedings{la_et_al:LIPIcs.SoCG.2024.90,
  author =	{La, Kacey Thien-Huu and Arbelo, Jose E. and Tralie, Christopher J.},
  title =	{{Visualizing Lucas’s Hamiltonian Paths Through the Associahedron 1-Skeleton}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{90:1--90:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.90},
  URN =		{urn:nbn:de:0030-drops-200355},
  doi =		{10.4230/LIPIcs.SoCG.2024.90},
  annote =	{Keywords: associahedron, hamiltonian paths, visualization, tree rotations, convex polygons}
}
@InProceedings{laske_et_al:LIPIcs.SoCG.2024.91,
  author =	{Laske, Olivia X. and Ziegelmeier, Lori},
  title =	{{Image Triangulation Using the Sobel Operator for Vertex Selection}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{91:1--91:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.91},
  URN =		{urn:nbn:de:0030-drops-200365},
  doi =		{10.4230/LIPIcs.SoCG.2024.91},
  annote =	{Keywords: Image Triangulation, Sharpening, Sobel Edge Detection, Delaunay Triangulation}
}
@InProceedings{parepally_et_al:LIPIcs.SoCG.2024.92,
  author =	{Parepally, Nithin and Chatterjee, Ainesh and Gezalyan, Auguste H. and Du, Hongyang and Mangla, Sukrit and Wu, Kenny and Hwang, Sarah and Mount, David M.},
  title =	{{Ipelets for the Convex Polygonal Geometry}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{92:1--92:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.92},
  URN =		{urn:nbn:de:0030-drops-200375},
  doi =		{10.4230/LIPIcs.SoCG.2024.92},
  annote =	{Keywords: Hilbert metric, Macbeath Regions, Polar Bodies, Convexity}
}