Table of Contents

• A Universal Triangulation for Flat ToriFrancis Lazarus, Florent Tallerie. [doi]
• Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)Jack Spalding-Jamieson, Brandon Zhang, Da-Wei Zheng. [doi]
• Tighter Bounds for Reconstruction from ε-SamplesHåvard Bakke Bjerkevik. [doi]
• An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition)Willem Sonke, Jules Wulms. [doi]
• Approximation Algorithms for Maximum Matchings in Geometric Intersection GraphsSariel Har-Peled, Everett Yang. [doi]
• The Degree-Rips Complexes of an Annulus with OutliersAlexander Rolle. [doi]
• Hop-Spanners for Geometric Intersection GraphsJonathan B. Conroy, Csaba D. Tóth. [doi]
• Farthest-Point Voronoi Diagrams in the Presence of Rectangular ObstaclesMincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn. [doi]
• Long Plane TreesSergio Cabello, Michael Hoffmann 0001, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec. [doi]
• Dynamic Connectivity in Disk GraphsHaim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth. [doi]
• True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk GraphsSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003. [doi]
• Swap, Shift and Trim to Edge Collapse a FiltrationMarc Glisse, Siddharth Pritam. [doi]
• Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree DualsTim Ophelders, Salman Parsa. [doi]
• Optimal Coreset for Gaussian Kernel Density EstimationWai Ming Tai. [doi]
• Acute Tours in the PlaneAhmad Biniaz. [doi]
• Robust Sylvester-Gallai Type Theorem for Quadratic PolynomialsShir Peleg, Amir Shpilka. [doi]
• Twisted Ways to Find Plane Structures in Simple Drawings of Complete GraphsOswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger. [doi]
• dRajesh Chitnis, Nitin Saurabh. [doi]
• Covering Points by Hyperplanes and Related ProblemsZuzana Patáková, Micha Sharir. [doi]
• The Complexity of the Hausdorff DistancePaul Jungeblut, Linda Kleist, Tillmann Miltzow. [doi]
• Persistent Cup-LengthMarco Contessoto, Facundo Mémoli, Anastasios Stefanou, Ling Zhou. [doi]
• On Comparable Box DimensionZdenek Dvorák, Daniel Gonçalves 0001, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt. [doi]
• Three-Chromatic Geometric HypergraphsGábor Damásdi, Dömötör Pálvölgyi. [doi]
• Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat AnglesLily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo. [doi]
• Computing Continuous Dynamic Time Warping of Time Series in Polynomial TimeKevin Buchin, André Nusser, Sampson Wong. [doi]
• Hardness and Approximation of Minimum Convex PartitionNicolas Grelier. [doi]
• Finding Weakly Simple Closed Quasigeodesics on Polyhedral SpheresJean Chartier, Arnaud de Mesmay. [doi]
• SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)André Schidler. [doi]
• Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo. [doi]
• Visualizing and Unfolding Nets of 4-Polytopes (Media Exposition)Satyan L. Devadoss, Matthew S. Harvey, Sam Zhang. [doi]
• Quasi-Universality of Reeb Graph DistancesUlrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr. [doi]
• Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical MeasuresYair Bartal, Ora Nova Fandina, Kasper Green Larsen. [doi]
• Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge)Florian Fontan, Pascal Lafourcade 0001, Luc Libralesso, Benjamin Momège. [doi]
• Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition)Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap. [doi]
• Asymptotic Bounds on the Combinatorial Diameter of Random PolytopesGilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts. [doi]
• Erdős-Szekeres-Type Problems in the Real Projective PlaneMartin Balko, Manfred Scheucher, Pavel Valtr. [doi]
• A Solution to Ringel's Circle ProblemJames Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak. [doi]
• Nearly-Doubling Spaces of Persistence DiagramsDonald R. Sheehy, Siddharth Sheth. [doi]
• Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related ProblemsPankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir. [doi]
• ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded TreewidthMitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset. [doi]
• A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition)Erin W. Chambers, Christopher Fillmore, Elizabeth Stephenson, Mathijs Wintraecken. [doi]
• 1-Norm MinimizationDominique Attali, André Lieutier. [doi]
• On the Discrete Fréchet Distance in a GraphAnne Driemel, Ivor van der Hoog, Eva Rotenberg. [doi]
• Disjointness Graphs of Short Polygonal ChainsJános Pach, Gábor Tardos, Géza Tóth 0001. [doi]
• Towards Sub-Quadratic Diameter Computation in Geometric Intersection GraphsKarl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian. [doi]
• Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its ApplicationsTamal K. Dey, Woojin Kim, Facundo Mémoli. [doi]
• Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition)Julien Bourgeois, Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Benoît Piranda, Christian Rieck, Christian Scheffer. [doi]
• From Geometry to Topology: Inverse Theorems for Distributed PersistenceElchanan Solomon, Alexander Wagner, Paul Bendich. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Minimum-Error Triangulations for Sea Surface ReconstructionAnna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin. [doi]
• A Positive Fraction Erdős-Szekeres Theorem and Its ApplicationsAndrew Suk, Ji Zeng. [doi]
• p-Metric on Merge TreesRobert Cardona, Justin Curry, Tung Lam, Michael Lesnick. [doi]
• On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling ProblemPeyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao 0001, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang 0002, Hao-Tsung Yang. [doi]
• Tracking Dynamical Features via Continuation and PersistenceTamal K. Dey, Michal Lipinski, Marian Mrozek, Ryan Slechta. [doi]
• Tiling with Squares and Packing Dominos in Polynomial TimeAnders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen. [doi]
• Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips FiltrationsUlrich Bauer, Fabian Roll. [doi]
• Edge Partitions of Complete Geometric GraphsOswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber. [doi]
• Chains, Koch Chains, and Point Sets with Many TriangulationsDaniel Rutschmann, Manuel Wettstein. [doi]
• Signed Barcodes for Multi-Parameter Persistence via Rank DecompositionsMagnus Bakke Botnan, Steffen Oppermann, Steve Oudot. [doi]
• On Semialgebraic Range ReportingPeyman Afshani, Pingan Cheng. [doi]
• Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower BoundHung Le, Lazar Milenkovic, Shay Solomon. [doi]
• Point Separation and Obstacle Removal by Finding and Hitting Odd CyclesNeeraj Kumar 0004, Daniel Lokshtanov, Saket Saurabh 0001, Subhash Suri, Jie Xue 0003. [doi]
• An (ℵ₀, k+2)-Theorem for k-TransversalsChaya Keller, Micha A. Perles. [doi]
• On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology ClassErin Wolf Chambers, Salman Parsa, Hannah Schreiber. [doi]
• Visualizing WSPDs and Their Applications (Media Exposition)Anirban Ghosh 0002, F. N. U. Shariful, David Wisnosky. [doi]
• Computing a Link Diagram from Its ExteriorNathan M. Dunfield, Malik Obeidin, Cameron Gates Rudd. [doi]
• Parameterised Partially-Predrawn Crossing NumberThekla Hamm, Petr Hlinený. [doi]
• pAlexandros Eskenazis. [doi]
• Unlabeled Multi-Robot Motion Planning with Tighter Separation BoundsBahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot. [doi]
• Robust Radical Sylvester-Gallai Theorem for QuadraticsAbhibhav Garg, Rafael Oliveira 0006, Akash Sengupta. [doi]
• Parameterized Algorithms for Upward PlanaritySteven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov. [doi]
• GPU Computation of the Euler Characteristic Curve for Imaging DataFan Wang 0010, Hubert Wagner, Chao Chen 0012. [doi]
• Weak Coloring Numbers of Intersection GraphsZdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky. [doi]
• Short Topological Decompositions of Non-Orientable SurfacesNiloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay. [doi]
• Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling CurvesKarl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser. [doi]