LIPIcs, Volume 224, SoCG 2022

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