Table of Contents

• Combinatorial Depth Measures for Hyperplane ArrangementsPatrick Schnider, Pablo Soberón. [doi]
• FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster RadiiSayan Bandyapadhyay, William Lochet, Saket Saurabh 0001. [doi]
• Algorithms for Length Spectra of Combinatorial ToriVincent Delecroix, Matthijs Ebbens, Francis Lazarus, Ivan Yakovlev. [doi]
• Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann FunctionHung Le, Lazar Milenkovic, Shay Solomon. [doi]
• The Complexity of Geodesic SpannersSarita de Berg, Marc J. van Kreveld, Frank Staals. [doi]
• Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d ≥ 4Egor Gorbachev, Marvin Künnemann. [doi]
• Topological Universality of the Art Gallery ProblemJack Stade, Jamie Tucker-Foltz. [doi]
• Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile GraphsEsther Galby, Andrea Munaro, Shizhou Yang. [doi]
• Line Intersection Searching Amid Unit Balls in 3-SpacePankaj K. Agarwal, Esther Ezra. [doi]
• Efficient Two-Parameter Persistence Computation via CohomologyUlrich Bauer, Fabian Lenzen, Michael Lesnick. [doi]
• Geometric Embeddability of Complexes Is ∃ℝ-CompleteMikkel Abrahamsen, Linda Kleist, Tillmann Miltzow. [doi]
• The Christoffel-Darboux Kernel for Topological Data AnalysisPepijn Roos Hoefgeest, Lucas Slot. [doi]
• FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector BundlesLuis Scoccola, Jose A. Perea. [doi]
• The Sum of Squares in Polycubes (Media Exposition)Donald R. Sheehy. [doi]
• When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and TechniquesThomas Fernique, Daria Pchelina. [doi]
• The Geodesic Edge Center of a Simple PolygonAnna Lubiw, Anurag Murty Naredla. [doi]
• Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice ReductionLuis Scoccola, Hitesh Gakhar, Johnathan Bush, Nikolas Schonsheck, Tatum Rask, Ling Zhou 0001, Jose A. Perea. [doi]
• Computing a Dirichlet Domain for a Hyperbolic SurfaceVincent Despré, Benedikt Kolbe, Hugo Parlier, Monique Teillaud. [doi]
• Meta-Diagrams for 2-Parameter PersistenceNate Clause, Tamal K. Dey, Facundo Mémoli, Bei Wang. [doi]
• Shortest Paths in PortalgonsMaarten Löffler, Tim Ophelders, Rodrigo I. Silveira, Frank Staals. [doi]
• Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel DataHubert Wagner. [doi]
• Decomposition of Zero-Dimensional Persistence Modules via Rooted SubsetsÁngel Javier Alonso, Michael Kerber. [doi]
• Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller SizeTimothy M. Chan, Zhengcheng Huang. [doi]
• Constructing Concise Convex Covers via Clique Covers (CG Challenge)Mikkel Abrahamsen, William Bille Meyling, André Nusser. [doi]
• Finding a Maximum Clique in a Disk GraphJared Espenant, J. Mark Keil, Debajyoti Mondal. [doi]
• Voronoi Diagrams in the Hilbert MetricAuguste H. Gezalyan, David M. Mount. [doi]
• Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn ProblemsAlfredo Hubard, Andrew Suk. [doi]
• Interactive 2D Periodic Graphs (Media Exposition)Alexandra Camero, Ileana Streinu. [doi]
• Minimum-Membership Geometric Set Cover, RevisitedSayan Bandyapadhyay, William Lochet, Saket Saurabh 0001, Jie Xue 0003. [doi]
• Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and ApplicationsEvanthia Papadopoulou. [doi]
• Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive OrderingsArnold Filtser. [doi]
• Improved Algebraic Degeneracy TestingJean Cardinal, Micha Sharir. [doi]
• On the Width of Complicated JSJ DecompositionsKristóf Huszár, Jonathan Spreer. [doi]
• Computing Instance-Optimal Kernels in Two DimensionsPankaj K. Agarwal, Sariel Har-Peled. [doi]
• Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial TimeDavid Eppstein. [doi]
• New Approximation Algorithms for Touring RegionsBenjamin Qi, Richard Qi. [doi]
• Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter TractableSujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg. [doi]
• Optimal Volume-Sensitive Bounds for Polytope ApproximationSunil Arya, David M. Mount. [doi]
• Coresets for Clustering in Geometric Intersection GraphsSayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar 0002. [doi]
• The Number of Edges in Maximal 2-Planar GraphsMichael Hoffmann 0001, Meghana M. Reddy. [doi]
• Ephemeral Persistence Features and the Stability of Filtered Chain ComplexesFacundo Mémoli, Ling Zhou 0001. [doi]
• Linear Size Universal Point Sets for Classes of Planar GraphsStefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner. [doi]
• Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under TranslationHonglin Zhu, Hyuk Jun Kweon. [doi]
• A Generalization of the Persistent Laplacian to Simplicial MapsAziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, Yusu Wang 0001. [doi]
• On Higher Dimensional Point Sets in General PositionAndrew Suk, Ji Zeng. [doi]
• On Helly Numbers of Exponential LatticesGergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi. [doi]
• The Parameterized Complexity of Coordinated Motion PlanningEduard Eiben, Robert Ganian, Iyad Kanj. [doi]
• Drawings of Complete Multipartite Graphs up to Triangle FlipsOswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann 0001, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger. [doi]
• Improved Bounds for Covering Paths and Trees in the PlaneAhmad Biniaz. [doi]
• Multilevel Skeletonization Using Local SeparatorsJ. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg. [doi]
• Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, Siddharth Sheth. [doi]
• Sparse Higher Order Čech FiltrationsMickaël Buchet, Bianca B. Dornelas, Michael Kerber. [doi]
• A Structural Approach to Tree Decompositions of Knots and Spatial GraphsCorentin Lunel, Arnaud de Mesmay. [doi]
• Random Projections for Curves in High DimensionsIoannis Psarros, Dennis Rohde. [doi]
• Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure ProblemTimothy M. Chan. [doi]
• On the Geometric Thickness of 2-Degenerate GraphsRahul Jain 0015, Marco Ricci, Jonathan Rollin, André Schulz 0001. [doi]
• Reconfiguration of Colorings in Triangulations of the SphereTakehiro Ito, Yuni Iwamasa, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. [doi]
• Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex DisksMikkel Abrahamsen, Bartosz Walczak. [doi]
• Online and Dynamic Algorithms for Geometric Set Cover and Hitting SetArindam Khan 0001, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese. [doi]
• Efficient Computation of Image PersistenceUlrich Bauer, Maximilian Schmahl. [doi]
• Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition)Richard Berger, Vincent Ha, David Kratz, Michael Lin, Jeremy Moyer, Christopher J. Tralie. [doi]
• Lower Bounds for Intersection Reporting Among Flat ObjectsPeyman Afshani, Pingan Cheng. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• An Extension Theorem for SignotopesHelena Bergold, Stefan Felsner, Manfred Scheucher. [doi]
• Shadoks Approach to Convex Covering (CG Challenge)Guilherme Dias da Fonseca. [doi]
• Finding Large Counterexamples by Selectively Exploring the Pachner GraphBenjamin A. Burton, Alexander He 0001. [doi]
• The Localized Union-Of-Balls BifiltrationMichael Kerber, Matthias Söls. [doi]
• Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar EmbeddingsJacob Holm, Ivor van der Hoog, Eva Rotenberg. [doi]