<h2>LIPIcs, Volume 224, SoCG 2022</h2>
<ul>
<li>
<span class="authors">Xavier Goaoc and Michael Kerber</span>
<span class="title">LIPIcs, Volume 224, SoCG 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022">10.4230/LIPIcs.SoCG.2022</a>
</li>
<li>
<span class="authors">Xavier Goaoc and Michael Kerber</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.0">10.4230/LIPIcs.SoCG.2022.0</a>
</li>
<li>
<span class="authors">Anders Aamand, Mikkel Abrahamsen, Thomas Ahle, and Peter M. R. Rasmussen</span>
<span class="title">Tiling with Squares and Packing Dominos in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.1">10.4230/LIPIcs.SoCG.2022.1</a>
</li>
<li>
<span class="authors">Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, and Hao-Tsung Yang</span>
<span class="title">On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.2">10.4230/LIPIcs.SoCG.2022.2</a>
</li>
<li>
<span class="authors">Peyman Afshani and Pingan Cheng</span>
<span class="title">On Semialgebraic Range Reporting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.3">10.4230/LIPIcs.SoCG.2022.3</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, and Micha Sharir</span>
<span class="title">Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.4">10.4230/LIPIcs.SoCG.2022.4</a>
</li>
<li>
<span class="authors">Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger</span>
<span class="title">Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.5">10.4230/LIPIcs.SoCG.2022.5</a>
</li>
<li>
<span class="authors">Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, and Birgit Vogtenhuber</span>
<span class="title">Edge Partitions of Complete Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.6">10.4230/LIPIcs.SoCG.2022.6</a>
</li>
<li>
<span class="authors">Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, and Heiko Röglin</span>
<span class="title">Minimum-Error Triangulations for Sea Surface Reconstruction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.7">10.4230/LIPIcs.SoCG.2022.7</a>
</li>
<li>
<span class="authors">Dominique Attali and André Lieutier</span>
<span class="title">Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.8">10.4230/LIPIcs.SoCG.2022.8</a>
</li>
<li>
<span class="authors">Håvard Bakke Bjerkevik</span>
<span class="title">Tighter Bounds for Reconstruction from ε-Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.9">10.4230/LIPIcs.SoCG.2022.9</a>
</li>
<li>
<span class="authors">Martin Balko, Manfred Scheucher, and Pavel Valtr</span>
<span class="title">Erdős-Szekeres-Type Problems in the Real Projective Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.10">10.4230/LIPIcs.SoCG.2022.10</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, and Jie Xue</span>
<span class="title">True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.11">10.4230/LIPIcs.SoCG.2022.11</a>
</li>
<li>
<span class="authors">Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, and Stijn Slot</span>
<span class="title">Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.12">10.4230/LIPIcs.SoCG.2022.12</a>
</li>
<li>
<span class="authors">Yair Bartal, Ora Nova Fandina, and Kasper Green Larsen</span>
<span class="title">Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.13">10.4230/LIPIcs.SoCG.2022.13</a>
</li>
<li>
<span class="authors">Ulrich Bauer, Håvard Bakke Bjerkevik, and Benedikt Fluhr</span>
<span class="title">Quasi-Universality of Reeb Graph Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.14">10.4230/LIPIcs.SoCG.2022.14</a>
</li>
<li>
<span class="authors">Ulrich Bauer and Fabian Roll</span>
<span class="title">Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips Filtrations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.15">10.4230/LIPIcs.SoCG.2022.15</a>
</li>
<li>
<span class="authors">Ahmad Biniaz</span>
<span class="title">Acute Tours in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.16">10.4230/LIPIcs.SoCG.2022.16</a>
</li>
<li>
<span class="authors">Mitchell Black, Nello Blaser, Amir Nayyeri, and Erlend Raa Vågset</span>
<span class="title">ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.17">10.4230/LIPIcs.SoCG.2022.17</a>
</li>
<li>
<span class="authors">Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, and Galyna Livshyts</span>
<span class="title">Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.18">10.4230/LIPIcs.SoCG.2022.18</a>
</li>
<li>
<span class="authors">Magnus Bakke Botnan, Steffen Oppermann, and Steve Oudot</span>
<span class="title">Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.19">10.4230/LIPIcs.SoCG.2022.19</a>
</li>
<li>
<span class="authors">Karl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, Dániel Marx, and André Nusser</span>
<span class="title">Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.20">10.4230/LIPIcs.SoCG.2022.20</a>
</li>
<li>
<span class="authors">Karl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, André Nusser, and Zahra Parsaeian</span>
<span class="title">Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.21">10.4230/LIPIcs.SoCG.2022.21</a>
</li>
<li>
<span class="authors">Kevin Buchin, André Nusser, and Sampson Wong</span>
<span class="title">Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.22">10.4230/LIPIcs.SoCG.2022.22</a>
</li>
<li>
<span class="authors">Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, and Josef Tkadlec</span>
<span class="title">Long Plane Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.23">10.4230/LIPIcs.SoCG.2022.23</a>
</li>
<li>
<span class="authors">Robert Cardona, Justin Curry, Tung Lam, and Michael Lesnick</span>
<span class="title">The Universal 𝓁^p-Metric on Merge Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.24">10.4230/LIPIcs.SoCG.2022.24</a>
</li>
<li>
<span class="authors">Erin Wolf Chambers, Salman Parsa, and Hannah Schreiber</span>
<span class="title">On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.25">10.4230/LIPIcs.SoCG.2022.25</a>
</li>
<li>
<span class="authors">Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov</span>
<span class="title">Parameterized Algorithms for Upward Planarity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.26">10.4230/LIPIcs.SoCG.2022.26</a>
</li>
<li>
<span class="authors">Jean Chartier and Arnaud de Mesmay</span>
<span class="title">Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.27">10.4230/LIPIcs.SoCG.2022.27</a>
</li>
<li>
<span class="authors">Rajesh Chitnis and Nitin Saurabh</span>
<span class="title">Tight Lower Bounds for Approximate & Exact k-Center in ℝ^d</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.28">10.4230/LIPIcs.SoCG.2022.28</a>
</li>
<li>
<span class="authors">Lily Chung, Erik D. Demaine, Dylan Hendrickson, and Victor Luo</span>
<span class="title">Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.29">10.4230/LIPIcs.SoCG.2022.29</a>
</li>
<li>
<span class="authors">Jonathan B. Conroy and Csaba D. Tóth</span>
<span class="title">Hop-Spanners for Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.30">10.4230/LIPIcs.SoCG.2022.30</a>
</li>
<li>
<span class="authors">Marco Contessoto, Facundo Mémoli, Anastasios Stefanou, and Ling Zhou</span>
<span class="title">Persistent Cup-Length</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.31">10.4230/LIPIcs.SoCG.2022.31</a>
</li>
<li>
<span class="authors">Gábor Damásdi and Dömötör Pálvölgyi</span>
<span class="title">Three-Chromatic Geometric Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.32">10.4230/LIPIcs.SoCG.2022.32</a>
</li>
<li>
<span class="authors">James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak</span>
<span class="title">A Solution to Ringel’s Circle Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.33">10.4230/LIPIcs.SoCG.2022.33</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Woojin Kim, and Facundo Mémoli</span>
<span class="title">Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.34">10.4230/LIPIcs.SoCG.2022.34</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Michał Lipiński, Marian Mrozek, and Ryan Slechta</span>
<span class="title">Tracking Dynamical Features via Continuation and Persistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.35">10.4230/LIPIcs.SoCG.2022.35</a>
</li>
<li>
<span class="authors">Anne Driemel, Ivor van der Hoog, and Eva Rotenberg</span>
<span class="title">On the Discrete Fréchet Distance in a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.36">10.4230/LIPIcs.SoCG.2022.36</a>
</li>
<li>
<span class="authors">Nathan M. Dunfield, Malik Obeidin, and Cameron Gates Rudd</span>
<span class="title">Computing a Link Diagram from Its Exterior</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.37">10.4230/LIPIcs.SoCG.2022.37</a>
</li>
<li>
<span class="authors">Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, and Torsten Ueckerdt</span>
<span class="title">On Comparable Box Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.38">10.4230/LIPIcs.SoCG.2022.38</a>
</li>
<li>
<span class="authors">Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt, and Yelena Yuditsky</span>
<span class="title">Weak Coloring Numbers of Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.39">10.4230/LIPIcs.SoCG.2022.39</a>
</li>
<li>
<span class="authors">Alexandros Eskenazis</span>
<span class="title">ε-Isometric Dimension Reduction for Incompressible Subsets of 𝓁_p</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.40">10.4230/LIPIcs.SoCG.2022.40</a>
</li>
<li>
<span class="authors">Niloufar Fuladi, Alfredo Hubard, and Arnaud de Mesmay</span>
<span class="title">Short Topological Decompositions of Non-Orientable Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.41">10.4230/LIPIcs.SoCG.2022.41</a>
</li>
<li>
<span class="authors">Abhibhav Garg, Rafael Oliveira, and Akash Kumar Sengupta</span>
<span class="title">Robust Radical Sylvester-Gallai Theorem for Quadratics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.42">10.4230/LIPIcs.SoCG.2022.42</a>
</li>
<li>
<span class="authors">Shir Peleg and Amir Shpilka</span>
<span class="title">Robust Sylvester-Gallai Type Theorem for Quadratic Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.43">10.4230/LIPIcs.SoCG.2022.43</a>
</li>
<li>
<span class="authors">Marc Glisse and Siddharth Pritam</span>
<span class="title">Swap, Shift and Trim to Edge Collapse a Filtration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.44">10.4230/LIPIcs.SoCG.2022.44</a>
</li>
<li>
<span class="authors">Nicolas Grelier</span>
<span class="title">Hardness and Approximation of Minimum Convex Partition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.45">10.4230/LIPIcs.SoCG.2022.45</a>
</li>
<li>
<span class="authors">Thekla Hamm and Petr Hliněný</span>
<span class="title">Parameterised Partially-Predrawn Crossing Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.46">10.4230/LIPIcs.SoCG.2022.46</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Everett Yang</span>
<span class="title">Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.47">10.4230/LIPIcs.SoCG.2022.47</a>
</li>
<li>
<span class="authors">Paul Jungeblut, Linda Kleist, and Tillmann Miltzow</span>
<span class="title">The Complexity of the Hausdorff Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.48">10.4230/LIPIcs.SoCG.2022.48</a>
</li>
<li>
<span class="authors">Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth</span>
<span class="title">Dynamic Connectivity in Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.49">10.4230/LIPIcs.SoCG.2022.49</a>
</li>
<li>
<span class="authors">Chaya Keller and Micha A. Perles</span>
<span class="title">An (ℵ₀,k+2)-Theorem for k-Transversals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.50">10.4230/LIPIcs.SoCG.2022.50</a>
</li>
<li>
<span class="authors">Mincheol Kim, Chanyang Seo, Taehoon Ahn, and Hee-Kap Ahn</span>
<span class="title">Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.51">10.4230/LIPIcs.SoCG.2022.51</a>
</li>
<li>
<span class="authors">Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, and Jie Xue</span>
<span class="title">Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.52">10.4230/LIPIcs.SoCG.2022.52</a>
</li>
<li>
<span class="authors">Francis Lazarus and Florent Tallerie</span>
<span class="title">A Universal Triangulation for Flat Tori</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.53">10.4230/LIPIcs.SoCG.2022.53</a>
</li>
<li>
<span class="authors">Hung Le, Lazar Milenković, and Shay Solomon</span>
<span class="title">Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.54">10.4230/LIPIcs.SoCG.2022.54</a>
</li>
<li>
<span class="authors">Tim Ophelders and Salman Parsa</span>
<span class="title">Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.55">10.4230/LIPIcs.SoCG.2022.55</a>
</li>
<li>
<span class="authors">János Pach, Gábor Tardos, and Géza Tóth</span>
<span class="title">Disjointness Graphs of Short Polygonal Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.56">10.4230/LIPIcs.SoCG.2022.56</a>
</li>
<li>
<span class="authors">Zuzana Patáková and Micha Sharir</span>
<span class="title">Covering Points by Hyperplanes and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.57">10.4230/LIPIcs.SoCG.2022.57</a>
</li>
<li>
<span class="authors">Alexander Rolle</span>
<span class="title">The Degree-Rips Complexes of an Annulus with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.58">10.4230/LIPIcs.SoCG.2022.58</a>
</li>
<li>
<span class="authors">Daniel Rutschmann and Manuel Wettstein</span>
<span class="title">Chains, Koch Chains, and Point Sets with Many Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.59">10.4230/LIPIcs.SoCG.2022.59</a>
</li>
<li>
<span class="authors">Donald R. Sheehy and Siddharth S. Sheth</span>
<span class="title">Nearly-Doubling Spaces of Persistence Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.60">10.4230/LIPIcs.SoCG.2022.60</a>
</li>
<li>
<span class="authors">Elchanan Solomon, Alexander Wagner, and Paul Bendich</span>
<span class="title">From Geometry to Topology: Inverse Theorems for Distributed Persistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.61">10.4230/LIPIcs.SoCG.2022.61</a>
</li>
<li>
<span class="authors">Andrew Suk and Ji Zeng</span>
<span class="title">A Positive Fraction Erdős-Szekeres Theorem and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.62">10.4230/LIPIcs.SoCG.2022.62</a>
</li>
<li>
<span class="authors">Wai Ming Tai</span>
<span class="title">Optimal Coreset for Gaussian Kernel Density Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.63">10.4230/LIPIcs.SoCG.2022.63</a>
</li>
<li>
<span class="authors">Fan Wang, Hubert Wagner, and Chao Chen</span>
<span class="title">GPU Computation of the Euler Characteristic Curve for Imaging Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.64">10.4230/LIPIcs.SoCG.2022.64</a>
</li>
<li>
<span class="authors">Julien Bourgeois, Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Benoît Piranda, Christian Rieck, and Christian Scheffer</span>
<span class="title">Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.65">10.4230/LIPIcs.SoCG.2022.65</a>
</li>
<li>
<span class="authors">Erin Chambers, Christopher Fillmore, Elizabeth Stephenson, and Mathijs Wintraecken</span>
<span class="title">A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.66">10.4230/LIPIcs.SoCG.2022.66</a>
</li>
<li>
<span class="authors">Satyan L. Devadoss, Matthew S. Harvey, and Sam Zhang</span>
<span class="title">Visualizing and Unfolding Nets of 4-Polytopes (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.67">10.4230/LIPIcs.SoCG.2022.67</a>
</li>
<li>
<span class="authors">Anirban Ghosh, FNU Shariful, and David Wisnosky</span>
<span class="title">Visualizing WSPDs and Their Applications (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.68">10.4230/LIPIcs.SoCG.2022.68</a>
</li>
<li>
<span class="authors">Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, and Chee Yap</span>
<span class="title">Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.69">10.4230/LIPIcs.SoCG.2022.69</a>
</li>
<li>
<span class="authors">Willem Sonke and Jules Wulms</span>
<span class="title">An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.70">10.4230/LIPIcs.SoCG.2022.70</a>
</li>
<li>
<span class="authors">Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, and Aldo Gonzalez-Lorenzo</span>
<span class="title">Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.71">10.4230/LIPIcs.SoCG.2022.71</a>
</li>
<li>
<span class="authors">Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng</span>
<span class="title">Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.72">10.4230/LIPIcs.SoCG.2022.72</a>
</li>
<li>
<span class="authors">Florian Fontan, Pascal Lafourcade, Luc Libralesso, and Benjamin Momège</span>
<span class="title">Local Search with Weighting Schemes for the CG:SHOP 2022 Competition (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.73">10.4230/LIPIcs.SoCG.2022.73</a>
</li>
<li>
<span class="authors">André Schidler</span>
<span class="title">SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2022.74">10.4230/LIPIcs.SoCG.2022.74</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