<h2>LIPIcs, Volume 293, SoCG 2024</h2>
<ul>
<li>
<span class="authors">Wolfgang Mulzer and Jeff M. Phillips</span>
<span class="title">LIPIcs, Volume 293, SoCG 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024">10.4230/LIPIcs.SoCG.2024</a>
</li>
<li>
<span class="authors">Wolfgang Mulzer and Jeff M. Phillips</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.0">10.4230/LIPIcs.SoCG.2024.0</a>
</li>
<li>
<span class="authors">Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, and Frederick Stock</span>
<span class="title">A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.1">10.4230/LIPIcs.SoCG.2024.1</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, and Leonidas Theocharous</span>
<span class="title">Clustering with Few Disks to Minimize the Sum of Radii</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.2">10.4230/LIPIcs.SoCG.2024.2</a>
</li>
<li>
<span class="authors">Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Raffay</span>
<span class="title">On the Number of Digons in Arrangements of Pairwise Intersecting Circles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.3">10.4230/LIPIcs.SoCG.2024.3</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Esther Ezra, and Micha Sharir</span>
<span class="title">Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.4">10.4230/LIPIcs.SoCG.2024.4</a>
</li>
<li>
<span class="authors">Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, and Kusha Sareen</span>
<span class="title">Communication Complexity and Discrepancy of Halfplanes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.5">10.4230/LIPIcs.SoCG.2024.5</a>
</li>
<li>
<span class="authors">Ángel Javier Alonso, Michael Kerber, and Primoz Skraba</span>
<span class="title">Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.6">10.4230/LIPIcs.SoCG.2024.6</a>
</li>
<li>
<span class="authors">Shinwoo An and Eunjin Oh</span>
<span class="title">ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.7">10.4230/LIPIcs.SoCG.2024.7</a>
</li>
<li>
<span class="authors">Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner</span>
<span class="title">Eight-Partitioning Points in 3D, and Efficiently Too</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.8">10.4230/LIPIcs.SoCG.2024.8</a>
</li>
<li>
<span class="authors">Boris Aronov, Mark de Berg, and Leonidas Theocharous</span>
<span class="title">A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ²</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.9">10.4230/LIPIcs.SoCG.2024.9</a>
</li>
<li>
<span class="authors">Boris Aronov, Tsuri Farhana, Matthew J. Katz, and Indu Ramesh</span>
<span class="title">Discrete Fréchet Distance Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.10">10.4230/LIPIcs.SoCG.2024.10</a>
</li>
<li>
<span class="authors">Dominique Attali, Hana Dal Poz Kouřimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken</span>
<span class="title">Tight Bounds for the Learning of Homotopy à la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.11">10.4230/LIPIcs.SoCG.2024.11</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay and Jie Xue</span>
<span class="title">An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.12">10.4230/LIPIcs.SoCG.2024.12</a>
</li>
<li>
<span class="authors">Willow Barkan, Huck Bennett, and Amir Nayyeri</span>
<span class="title">Topological k-Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.13">10.4230/LIPIcs.SoCG.2024.13</a>
</li>
<li>
<span class="authors">Brannon Basilio, Chaeryn Lee, and Joseph Malionek</span>
<span class="title">Totally Geodesic Surfaces in Hyperbolic 3-Manifolds: Algorithms and Examples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.14">10.4230/LIPIcs.SoCG.2024.14</a>
</li>
<li>
<span class="authors">Ulrich Bauer and Fabian Roll</span>
<span class="title">Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.15">10.4230/LIPIcs.SoCG.2024.15</a>
</li>
<li>
<span class="authors">Mark de Berg and Leonidas Theocharous</span>
<span class="title">A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.16">10.4230/LIPIcs.SoCG.2024.16</a>
</li>
<li>
<span class="authors">Sarita de Berg, Tillmann Miltzow, and Frank Staals</span>
<span class="title">Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.17">10.4230/LIPIcs.SoCG.2024.17</a>
</li>
<li>
<span class="authors">Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, and Manfred Scheucher</span>
<span class="title">Plane Hamiltonian Cycles in Convex Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.18">10.4230/LIPIcs.SoCG.2024.18</a>
</li>
<li>
<span class="authors">Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms</span>
<span class="title">Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.19">10.4230/LIPIcs.SoCG.2024.19</a>
</li>
<li>
<span class="authors">Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink</span>
<span class="title">Constrained and Ordered Level Planarity Parameterized by the Number of Levels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.20">10.4230/LIPIcs.SoCG.2024.20</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, and Siddharth Pritam</span>
<span class="title">On Edge Collapse of Random Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.21">10.4230/LIPIcs.SoCG.2024.21</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Lucas de Meyer, Théo Pierron, and Alexandra Wesolek</span>
<span class="title">Reconfiguration of Plane Trees in Convex Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.22">10.4230/LIPIcs.SoCG.2024.22</a>
</li>
<li>
<span class="authors">Mathilde Bouvel, Valentin Feray, Xavier Goaoc, and Florent Koechlin</span>
<span class="title">A Canonical Tree Decomposition for Chirotopes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.23">10.4230/LIPIcs.SoCG.2024.23</a>
</li>
<li>
<span class="authors">Bruce Brewer, Gerth Stølting Brodal, and Haitao Wang</span>
<span class="title">Dynamic Convex Hulls for Simple Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.24">10.4230/LIPIcs.SoCG.2024.24</a>
</li>
<li>
<span class="authors">Karl Bringmann, Frank Staals, Karol Węgrzycki, and Geert van Wordragen</span>
<span class="title">Fine-Grained Complexity of Earth Mover’s Distance Under Translation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.25">10.4230/LIPIcs.SoCG.2024.25</a>
</li>
<li>
<span class="authors">Moritz Buchem, Paul Deuker, and Andreas Wiese</span>
<span class="title">Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.26">10.4230/LIPIcs.SoCG.2024.26</a>
</li>
<li>
<span class="authors">Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, and Sampson Wong</span>
<span class="title">Map-Matching Queries Under Fréchet Distance on Low-Density Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.27">10.4230/LIPIcs.SoCG.2024.27</a>
</li>
<li>
<span class="authors">Denys Bulavka, Éric Colin de Verdière, and Niloufar Fuladi</span>
<span class="title">Computing Shortest Closed Curves on Non-Orientable Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.28">10.4230/LIPIcs.SoCG.2024.28</a>
</li>
<li>
<span class="authors">Rhuaidi Antonio Burke</span>
<span class="title">Practical Software for Triangulating and Simplifying 4-Manifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.29">10.4230/LIPIcs.SoCG.2024.29</a>
</li>
<li>
<span class="authors">Benjamin A. Burton and Finn Thompson</span>
<span class="title">Effective Computation of the Heegaard Genus of 3-Manifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.30">10.4230/LIPIcs.SoCG.2024.30</a>
</li>
<li>
<span class="authors">Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, and Christian Knauer</span>
<span class="title">Geometric Matching and Bottleneck Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.31">10.4230/LIPIcs.SoCG.2024.31</a>
</li>
<li>
<span class="authors">Luca Castelli Aleardi and Olivier Devillers</span>
<span class="title">SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.32">10.4230/LIPIcs.SoCG.2024.32</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Pingan Cheng, and Da Wei Zheng</span>
<span class="title">Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.33">10.4230/LIPIcs.SoCG.2024.33</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Isaac M. Hair</span>
<span class="title">Convex Polygon Containment: Improving Quadratic to Near Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.34">10.4230/LIPIcs.SoCG.2024.34</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Qizheng He, and Jie Xue</span>
<span class="title">Enclosing Points with Geometric Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.35">10.4230/LIPIcs.SoCG.2024.35</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Zhengcheng Huang</span>
<span class="title">Dynamic Geometric Connectivity in the Plane with Constant Query Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.36">10.4230/LIPIcs.SoCG.2024.36</a>
</li>
<li>
<span class="authors">Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, and Cuong Than</span>
<span class="title">Optimal Euclidean Tree Covers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.37">10.4230/LIPIcs.SoCG.2024.37</a>
</li>
<li>
<span class="authors">Hsien-Chih Chang, Jie Gao, and Hung Le</span>
<span class="title">Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.38">10.4230/LIPIcs.SoCG.2024.38</a>
</li>
<li>
<span class="authors">Dror Chawin and Ishay Haviv</span>
<span class="title">Nearly Orthogonal Sets over Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.39">10.4230/LIPIcs.SoCG.2024.39</a>
</li>
<li>
<span class="authors">Kyungjin Cho, Eunjin Oh, Haitao Wang, and Jie Xue</span>
<span class="title">Optimal Algorithm for the Planar Two-Center Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.40">10.4230/LIPIcs.SoCG.2024.40</a>
</li>
<li>
<span class="authors">Suyoung Choi, Hyeontae Jang, and Mathieu Vallée</span>
<span class="title">GPU Algorithm for Enumerating PL Spheres of Picard Number 4: Application to Toric Topology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.41">10.4230/LIPIcs.SoCG.2024.41</a>
</li>
<li>
<span class="authors">Jacobus Conradi, Benedikt Kolbe, Ioannis Psarros, and Dennis Rohde</span>
<span class="title">Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.42">10.4230/LIPIcs.SoCG.2024.42</a>
</li>
<li>
<span class="authors">Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, and Manfred Scheucher</span>
<span class="title">An Improved Lower Bound on the Number of Pseudoline Arrangements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.43">10.4230/LIPIcs.SoCG.2024.43</a>
</li>
<li>
<span class="authors">Justin Curry, Washington Mio, Tom Needham, Osman Berat Okutan, and Florian Russold</span>
<span class="title">Stability and Approximations for Decorated Reeb Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.44">10.4230/LIPIcs.SoCG.2024.44</a>
</li>
<li>
<span class="authors">Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, and Saurabh Ray</span>
<span class="title">Sweeping Arrangements of Non-Piercing Regions in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.45">10.4230/LIPIcs.SoCG.2024.45</a>
</li>
<li>
<span class="authors">Gábor Damásdi, Zichao Dong, Manfred Scheucher, and Ji Zeng</span>
<span class="title">Saturation Results Around the Erdős-Szekeres Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.46">10.4230/LIPIcs.SoCG.2024.46</a>
</li>
<li>
<span class="authors">Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph S.B. Mitchell</span>
<span class="title">Robustly Guarding Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.47">10.4230/LIPIcs.SoCG.2024.47</a>
</li>
<li>
<span class="authors">Pierre Dehornoy, Corentin Lunel, and Arnaud de Mesmay</span>
<span class="title">Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.48">10.4230/LIPIcs.SoCG.2024.48</a>
</li>
<li>
<span class="authors">Tamal K. Dey and Tao Hou</span>
<span class="title">Computing Zigzag Vineyard Efficiently Including Expansions and Contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.49">10.4230/LIPIcs.SoCG.2024.49</a>
</li>
<li>
<span class="authors">Tamal K. Dey and Abhishek Rathod</span>
<span class="title">Cup Product Persistence and Its Efficient Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.50">10.4230/LIPIcs.SoCG.2024.50</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Florian Russold, and Shreyas N. Samaga</span>
<span class="title">Efficient Algorithms for Complexes of Persistence Modules with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.51">10.4230/LIPIcs.SoCG.2024.51</a>
</li>
<li>
<span class="authors">Michael Gene Dobbins, Andreas F. Holmsen, and Dohyeon Lee</span>
<span class="title">Colorful Intersections and Tverberg Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.52">10.4230/LIPIcs.SoCG.2024.52</a>
</li>
<li>
<span class="authors">Herbert Edelsbrunner and János Pach</span>
<span class="title">Maximum Betti Numbers of Čech Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.53">10.4230/LIPIcs.SoCG.2024.53</a>
</li>
<li>
<span class="authors">Friedrich Eisenbrand, Matthieu Haeberle, and Neta Singer</span>
<span class="title">An Improved Bound on Sums of Square Roots via the Subspace Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.54">10.4230/LIPIcs.SoCG.2024.54</a>
</li>
<li>
<span class="authors">Alexandros Eskenazis</span>
<span class="title">Dimensionality of Hamming Metrics and Rademacher Type</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.55">10.4230/LIPIcs.SoCG.2024.55</a>
</li>
<li>
<span class="authors">Arnold Filtser, Yuval Gitlitz, and Ofer Neiman</span>
<span class="title">Light, Reliable Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.56">10.4230/LIPIcs.SoCG.2024.56</a>
</li>
<li>
<span class="authors">Jacob Focke, Florian Hörsch, Shaohua Li, and Dániel Marx</span>
<span class="title">Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.57">10.4230/LIPIcs.SoCG.2024.57</a>
</li>
<li>
<span class="authors">Emily Fox, Amir Nayyeri, Jonathan James Perry, and Benjamin Raichel</span>
<span class="title">Fréchet Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.58">10.4230/LIPIcs.SoCG.2024.58</a>
</li>
<li>
<span class="authors">Jacob Fox, János Pach, and Andrew Suk</span>
<span class="title">A Structure Theorem for Pseudo-Segments and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.59">10.4230/LIPIcs.SoCG.2024.59</a>
</li>
<li>
<span class="authors">Zhimeng Gao and Sariel Har-Peled</span>
<span class="title">Near Optimal Locality Sensitive Orderings in Euclidean Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.60">10.4230/LIPIcs.SoCG.2024.60</a>
</li>
<li>
<span class="authors">Fabrizio Grandoni, Edin Husić, Mathieu Mari, and Antoine Tinguely</span>
<span class="title">Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.61">10.4230/LIPIcs.SoCG.2024.61</a>
</li>
<li>
<span class="authors">Joachim Gudmundsson, Martin P. Seybold, and Sampson Wong</span>
<span class="title">Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.62">10.4230/LIPIcs.SoCG.2024.62</a>
</li>
<li>
<span class="authors">Thijs van der Horst and Tim Ophelders</span>
<span class="title">Faster Fréchet Distance Approximation Through Truncated Smoothing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.63">10.4230/LIPIcs.SoCG.2024.63</a>
</li>
<li>
<span class="authors">Shaofeng H.-C. Jiang, Robert Krauthgamer, and Shay Sapir</span>
<span class="title">Moderate Dimension Reduction for k-Center Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.64">10.4230/LIPIcs.SoCG.2024.64</a>
</li>
<li>
<span class="authors">Iyad Kanj and Salman Parsa</span>
<span class="title">On the Parameterized Complexity of Motion Planning for Rectangular Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.65">10.4230/LIPIcs.SoCG.2024.65</a>
</li>
<li>
<span class="authors">Chaya Keller and Shakhar Smorodinsky</span>
<span class="title">Zarankiewicz’s Problem via ε-t-Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.66">10.4230/LIPIcs.SoCG.2024.66</a>
</li>
<li>
<span class="authors">Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, and Karol Węgrzycki</span>
<span class="title">Separator Theorem and Algorithms for Planar Hyperbolic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.67">10.4230/LIPIcs.SoCG.2024.67</a>
</li>
<li>
<span class="authors">Sándor Kisfaludi-Bak and Geert van Wordragen</span>
<span class="title">A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.68">10.4230/LIPIcs.SoCG.2024.68</a>
</li>
<li>
<span class="authors">Hana Dal Poz Kouřimská, André Lieutier, and Mathijs Wintraecken</span>
<span class="title">The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.69">10.4230/LIPIcs.SoCG.2024.69</a>
</li>
<li>
<span class="authors">Uzu Lim</span>
<span class="title">Strange Random Topology of the Circle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.70">10.4230/LIPIcs.SoCG.2024.70</a>
</li>
<li>
<span class="authors">Hong Liu, Chong Shangguan, Jozef Skokan, and Zixiang Xu</span>
<span class="title">Beyond Chromatic Threshold via (p,q)-Theorem, and Blow-Up Phenomenon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.71">10.4230/LIPIcs.SoCG.2024.71</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi</span>
<span class="title">A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.72">10.4230/LIPIcs.SoCG.2024.72</a>
</li>
<li>
<span class="authors">Sushovan Majhi</span>
<span class="title">Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.73">10.4230/LIPIcs.SoCG.2024.73</a>
</li>
<li>
<span class="authors">Tim Planken and Torsten Ueckerdt</span>
<span class="title">Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.74">10.4230/LIPIcs.SoCG.2024.74</a>
</li>
<li>
<span class="authors">Yohai Reani and Omer Bobrowski</span>
<span class="title">Morse Theory for the k-NN Distance Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.75">10.4230/LIPIcs.SoCG.2024.75</a>
</li>
<li>
<span class="authors">Günter Rote, Moritz Rüber, and Morteza Saghafian</span>
<span class="title">Grid Peeling of Parabolas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.76">10.4230/LIPIcs.SoCG.2024.76</a>
</li>
<li>
<span class="authors">Patrick Schnider and Simon Weber</span>
<span class="title">A Topological Version of Schaefer’s Dichotomy Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.77">10.4230/LIPIcs.SoCG.2024.77</a>
</li>
<li>
<span class="authors">Martin Tancer</span>
<span class="title">Pach’s Animal Problem Within the Bounding Box</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.78">10.4230/LIPIcs.SoCG.2024.78</a>
</li>
<li>
<span class="authors">Haitao Wang and Jie Xue</span>
<span class="title">Algorithms for Halfplane Coverage and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.79">10.4230/LIPIcs.SoCG.2024.79</a>
</li>
<li>
<span class="authors">Qingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy, and Bei Wang</span>
<span class="title">Measure-Theoretic Reeb Graphs and Reeb Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.80">10.4230/LIPIcs.SoCG.2024.80</a>
</li>
<li>
<span class="authors">Ernest van Wijland and Hang Zhou</span>
<span class="title">Faster Approximation Scheme for Euclidean k-TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.81">10.4230/LIPIcs.SoCG.2024.81</a>
</li>
<li>
<span class="authors">Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, and Zengfeng Huang</span>
<span class="title">Space Complexity of Euclidean Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.82">10.4230/LIPIcs.SoCG.2024.82</a>
</li>
<li>
<span class="authors">Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, and Patrick Pawelczyk</span>
<span class="title">Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.83">10.4230/LIPIcs.SoCG.2024.83</a>
</li>
<li>
<span class="authors">Guilherme D. da Fonseca and Yan Gerard</span>
<span class="title">Shadoks Approach to Knapsack Polygonal Packing (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.84">10.4230/LIPIcs.SoCG.2024.84</a>
</li>
<li>
<span class="authors">Martin Held</span>
<span class="title">Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.85">10.4230/LIPIcs.SoCG.2024.85</a>
</li>
<li>
<span class="authors">Canhui Luo, Zhouxing Su, and Zhipeng Lü</span>
<span class="title">A General Heuristic Approach for Maximum Polygon Packing (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.86">10.4230/LIPIcs.SoCG.2024.86</a>
</li>
<li>
<span class="authors">Dominique Attali, Hana Dal Poz Kouřimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken</span>
<span class="title">The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.87">10.4230/LIPIcs.SoCG.2024.87</a>
</li>
<li>
<span class="authors">Marjolein Haagsman, Maarten Löffler, and Carola Wenk</span>
<span class="title">Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.88">10.4230/LIPIcs.SoCG.2024.88</a>
</li>
<li>
<span class="authors">Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, and Bettina Speckmann</span>
<span class="title">Optimal In-Place Compaction of Sliding Cubes (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.89">10.4230/LIPIcs.SoCG.2024.89</a>
</li>
<li>
<span class="authors">Kacey Thien-Huu La, Jose E. Arbelo, and Christopher J. Tralie</span>
<span class="title">Visualizing Lucas’s Hamiltonian Paths Through the Associahedron 1-Skeleton (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.90">10.4230/LIPIcs.SoCG.2024.90</a>
</li>
<li>
<span class="authors">Olivia X. Laske and Lori Ziegelmeier</span>
<span class="title">Image Triangulation Using the Sobel Operator for Vertex Selection (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.91">10.4230/LIPIcs.SoCG.2024.91</a>
</li>
<li>
<span class="authors">Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, and David M. Mount</span>
<span class="title">Ipelets for the Convex Polygonal Geometry (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2024.92">10.4230/LIPIcs.SoCG.2024.92</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing