LIPIcs, Volume 258, SoCG 2023

• Erin W. Chambers and Joachim Gudmundsson LIPIcs, Volume 258, SoCG 2023, Complete Volume 10.4230/LIPIcs.SoCG.2023
• Erin W. Chambers and Joachim Gudmundsson Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SoCG.2023.0
• Mikkel Abrahamsen, Linda Kleist, and Tillmann Miltzow Geometric Embeddability of Complexes Is ∃ℝ-Complete 10.4230/LIPIcs.SoCG.2023.1
• Mikkel Abrahamsen and Bartosz Walczak Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks 10.4230/LIPIcs.SoCG.2023.2
• Peyman Afshani and Pingan Cheng Lower Bounds for Intersection Reporting Among Flat Objects 10.4230/LIPIcs.SoCG.2023.3
• Pankaj K. Agarwal and Sariel Har-Peled Computing Instance-Optimal Kernels in Two Dimensions 10.4230/LIPIcs.SoCG.2023.4
• Pankaj K. Agarwal and Esther Ezra Line Intersection Searching Amid Unit Balls in 3-Space 10.4230/LIPIcs.SoCG.2023.5
• Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger Drawings of Complete Multipartite Graphs up to Triangle Flips 10.4230/LIPIcs.SoCG.2023.6
• Ángel Javier Alonso and Michael Kerber Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets 10.4230/LIPIcs.SoCG.2023.7
• Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, and Márton Naszódi On Helly Numbers of Exponential Lattices 10.4230/LIPIcs.SoCG.2023.8
• Sunil Arya and David M. Mount Optimal Volume-Sensitive Bounds for Polytope Approximation 10.4230/LIPIcs.SoCG.2023.9
• Sayan Bandyapadhyay, Fedor V. Fomin, and Tanmay Inamdar Coresets for Clustering in Geometric Intersection Graphs 10.4230/LIPIcs.SoCG.2023.10
• Sayan Bandyapadhyay, William Lochet, Saket Saurabh, and Jie Xue Minimum-Membership Geometric Set Cover, Revisited 10.4230/LIPIcs.SoCG.2023.11
• Sayan Bandyapadhyay, William Lochet, and Saket Saurabh FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii 10.4230/LIPIcs.SoCG.2023.12
• J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, and Eva Rotenberg Multilevel Skeletonization Using Local Separators 10.4230/LIPIcs.SoCG.2023.13
• Ulrich Bauer and Maximilian Schmahl Efficient Computation of Image Persistence 10.4230/LIPIcs.SoCG.2023.14
• Ulrich Bauer, Fabian Lenzen, and Michael Lesnick Efficient Two-Parameter Persistence Computation via Cohomology 10.4230/LIPIcs.SoCG.2023.15
• Sarita de Berg, Marc van Kreveld, and Frank Staals The Complexity of Geodesic Spanners 10.4230/LIPIcs.SoCG.2023.16
• Helena Bergold, Stefan Felsner, and Manfred Scheucher An Extension Theorem for Signotopes 10.4230/LIPIcs.SoCG.2023.17
• Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, and Martin Nöllenburg Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable 10.4230/LIPIcs.SoCG.2023.18
• Ahmad Biniaz Improved Bounds for Covering Paths and Trees in the Plane 10.4230/LIPIcs.SoCG.2023.19
• Mickaël Buchet, Bianca B. Dornelas, and Michael Kerber Sparse Higher Order Čech Filtrations 10.4230/LIPIcs.SoCG.2023.20
• Benjamin A. Burton and Alexander He Finding Large Counterexamples by Selectively Exploring the Pachner Graph 10.4230/LIPIcs.SoCG.2023.21
• Jean Cardinal and Micha Sharir Improved Algebraic Degeneracy Testing 10.4230/LIPIcs.SoCG.2023.22
• Timothy M. Chan and Zhengcheng Huang Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size 10.4230/LIPIcs.SoCG.2023.23
• Timothy M. Chan Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee’s Measure Problem 10.4230/LIPIcs.SoCG.2023.24
• Nate Clause, Tamal K. Dey, Facundo Mémoli, and Bei Wang Meta-Diagrams for 2-Parameter Persistence 10.4230/LIPIcs.SoCG.2023.25
• Vincent Delecroix, Matthijs Ebbens, Francis Lazarus, and Ivan Yakovlev Algorithms for Length Spectra of Combinatorial Tori 10.4230/LIPIcs.SoCG.2023.26
• Vincent Despré, Benedikt Kolbe, Hugo Parlier, and Monique Teillaud Computing a Dirichlet Domain for a Hyperbolic Surface 10.4230/LIPIcs.SoCG.2023.27
• Eduard Eiben, Robert Ganian, and Iyad Kanj The Parameterized Complexity of Coordinated Motion Planning 10.4230/LIPIcs.SoCG.2023.28
• David Eppstein Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time 10.4230/LIPIcs.SoCG.2023.29
• Jared Espenant, J. Mark Keil, and Debajyoti Mondal Finding a Maximum Clique in a Disk Graph 10.4230/LIPIcs.SoCG.2023.30
• Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, and Raphael Steiner Linear Size Universal Point Sets for Classes of Planar Graphs 10.4230/LIPIcs.SoCG.2023.31
• Thomas Fernique and Daria Pchelina When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and Techniques 10.4230/LIPIcs.SoCG.2023.32
• Arnold Filtser Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings 10.4230/LIPIcs.SoCG.2023.33
• Esther Galby, Andrea Munaro, and Shizhou Yang Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs 10.4230/LIPIcs.SoCG.2023.34
• Auguste H. Gezalyan and David M. Mount Voronoi Diagrams in the Hilbert Metric 10.4230/LIPIcs.SoCG.2023.35
• Egor Gorbachev and Marvin Künnemann Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4 10.4230/LIPIcs.SoCG.2023.36
• Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, and Yusu Wang A Generalization of the Persistent Laplacian to Simplicial Maps 10.4230/LIPIcs.SoCG.2023.37
• Pepijn Roos Hoefgeest and Lucas Slot The Christoffel-Darboux Kernel for Topological Data Analysis 10.4230/LIPIcs.SoCG.2023.38
• Michael Hoffmann and Meghana M. Reddy The Number of Edges in Maximal 2-Planar Graphs 10.4230/LIPIcs.SoCG.2023.39
• Jacob Holm, Ivor van der Hoog, and Eva Rotenberg Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings 10.4230/LIPIcs.SoCG.2023.40
• Alfredo Hubard and Andrew Suk Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems 10.4230/LIPIcs.SoCG.2023.41
• Kristóf Huszár and Jonathan Spreer On the Width of Complicated JSJ Decompositions 10.4230/LIPIcs.SoCG.2023.42
• Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki Reconfiguration of Colorings in Triangulations of the Sphere 10.4230/LIPIcs.SoCG.2023.43
• Rahul Jain, Marco Ricci, Jonathan Rollin, and André Schulz On the Geometric Thickness of 2-Degenerate Graphs 10.4230/LIPIcs.SoCG.2023.44
• Michael Kerber and Matthias Söls The Localized Union-Of-Balls Bifiltration 10.4230/LIPIcs.SoCG.2023.45
• Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, and Andreas Wiese Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set 10.4230/LIPIcs.SoCG.2023.46
• Hung Le, Lazar Milenković, and Shay Solomon Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function 10.4230/LIPIcs.SoCG.2023.47
• Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, and Frank Staals Shortest Paths in Portalgons 10.4230/LIPIcs.SoCG.2023.48
• Anna Lubiw and Anurag Murty Naredla The Geodesic Edge Center of a Simple Polygon 10.4230/LIPIcs.SoCG.2023.49
• Corentin Lunel and Arnaud de Mesmay A Structural Approach to Tree Decompositions of Knots and Spatial Graphs 10.4230/LIPIcs.SoCG.2023.50
• Facundo Mémoli and Ling Zhou Ephemeral Persistence Features and the Stability of Filtered Chain Complexes 10.4230/LIPIcs.SoCG.2023.51
• Evanthia Papadopoulou Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications 10.4230/LIPIcs.SoCG.2023.52
• Ioannis Psarros and Dennis Rohde Random Projections for Curves in High Dimensions 10.4230/LIPIcs.SoCG.2023.53
• Benjamin Qi and Richard Qi New Approximation Algorithms for Touring Regions 10.4230/LIPIcs.SoCG.2023.54
• Patrick Schnider and Pablo Soberón Combinatorial Depth Measures for Hyperplane Arrangements 10.4230/LIPIcs.SoCG.2023.55
• Luis Scoccola and Jose A. Perea FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles 10.4230/LIPIcs.SoCG.2023.56
• Luis Scoccola, Hitesh Gakhar, Johnathan Bush, Nikolas Schonsheck, Tatum Rask, Ling Zhou, and Jose A. Perea Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice Reduction 10.4230/LIPIcs.SoCG.2023.57
• Jack Stade and Jamie Tucker-Foltz Topological Universality of the Art Gallery Problem 10.4230/LIPIcs.SoCG.2023.58
• Andrew Suk and Ji Zeng On Higher Dimensional Point Sets in General Position 10.4230/LIPIcs.SoCG.2023.59
• Hubert Wagner Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data 10.4230/LIPIcs.SoCG.2023.60
• Honglin Zhu and Hyuk Jun Kweon Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under Translation 10.4230/LIPIcs.SoCG.2023.61
• Richard Berger, Vincent Ha, David Kratz, Michael Lin, Jeremy Moyer, and Christopher J. Tralie Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition) 10.4230/LIPIcs.SoCG.2023.62
• Alexandra Camero and Ileana Streinu Interactive 2D Periodic Graphs (Media Exposition) 10.4230/LIPIcs.SoCG.2023.63
• Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, and Siddharth S. Sheth Greedy Permutations and Finite Voronoi Diagrams (Media Exposition) 10.4230/LIPIcs.SoCG.2023.64
• Donald R. Sheehy The Sum of Squares in Polycubes (Media Exposition) 10.4230/LIPIcs.SoCG.2023.65
• Mikkel Abrahamsen, William Bille Meyling, and André Nusser Constructing Concise Convex Covers via Clique Covers (CG Challenge) 10.4230/LIPIcs.SoCG.2023.66
• Guilherme D. da Fonseca Shadoks Approach to Convex Covering (CG Challenge) 10.4230/LIPIcs.SoCG.2023.67