Table of Contents

• Embedding Graphs as Euclidean kNN-GraphsThomas Schibler, Subhash Suri, Jie Xue 0003. [doi]
• Optimal Motion Planning for Two Square Robots in a Rectilinear EnvironmentPankaj K. Agarwal, Mark de Berg, Benjamin Holmgren, Alex Steiger, Martijn Struijs. [doi]
• Snap Rounding: A Cautionary TaleJohn Hershberger 0001. [doi]
• Super-Polynomial Growth of the Generalized Persistence DiagramDonghan Kim, Woojin Kim 0001, Wonjun Lee. [doi]
• Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge)Mikkel Abrahamsen, Florestan Brunck, Jacobus Conradi, Benedikt Kolbe, André Nusser. [doi]
• Signotopes with Few Plus SignsHelena Bergold, Lukas Egeling, Hung P. Hoang 0001. [doi]
• A Sparse Multicover Bifiltration of Linear SizeÁngel Javier Alonso. [doi]
• A Theory of Sub-BarcodesOliver A. Chubet, Kirk P. Gardner, Donald R. Sheehy. [doi]
• Computing Geomorphologically Salient Networks via Discrete Morse TheoryTim Ophelders, Anna Schenfisch, Willem Sonke, Bettina Speckmann. [doi]
• The Point-Boundary Art Gallery Problem Is ∃ℝ-HardJack Stade. [doi]
• Exact Algorithms for Minimum Dilation TriangulationSándor P. Fekete, Phillip Keldenich, Michael Perk. [doi]
• Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate TechniqueTimothy M. Chan, Zhengcheng Huang. [doi]
• Hard Diagrams of Split LinksCorentin Lunel, Arnaud de Mesmay, Jonathan Spreer. [doi]
• Simplification of Trajectory StreamsSiu-Wing Cheng, Haoqiang Huang, Le Jiang. [doi]
• Non-Euclidean Erdős-Anning TheoremsDavid Eppstein. [doi]
• Nearest Neighbor Searching in a Dynamic Simple PolygonSarita de Berg, Frank Staals. [doi]
• A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under TranslationTimothy M. Chan, Isaac M. Hair. [doi]
• The Erdős-Szekeres Conjecture RevisitedJineon Baek, Martin Balko. [doi]
• Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection GraphsJames Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty. [doi]
• On Approximability of ℓ₂² Min-Sum ClusteringKarthik C. S. 0001, Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, Samson Zhou. [doi]
• Higher Order Bipartiteness vs Bi-Partitioning in Simplicial ComplexesMarzieh Eidi, Sayan Mukherjee 0001. [doi]
• k-Dimensional Transversals for Fat Convex SetsAttila Jung, Dömötör Pálvölgyi. [doi]
• Apex RepresentativesTamal K. Dey, Tao Hou 0002, Dmitriy Morozov. [doi]
• Software for the Thompson and Funk Polygonal Geometry (Media Exposition)Hridhaan Banerjee, Carmen Isabel Day, Auguste H. Gezalyan, Olga Golovatskaia, Megan Hunleth, Sarah Hwang, Nithin Parepally, Lucy Wang, David M. Mount. [doi]
• Immersions and Albertson's ConjectureJacob Fox, János Pach, Andrew Suk. [doi]
• Small Triangulations of 4-Manifolds and the 4-Manifold CensusRhuaidi Antonio Burke, Benjamin A. Burton, Jonathan Spreer. [doi]
• Decomposing Multiparameter Persistence ModulesTamal K. Dey, Jan Jendrysiak, Michael Kerber. [doi]
• Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set ConstructionShion Fukuzawa, Michael T. Goodrich, Sandy Irani. [doi]
• Incremental and Interactive PQ- and PC-Trees (Media Exposition)Simon D. Fink, Dominik Peters. [doi]
• Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent HomologyDmitriy Morozov, Luis Scoccola. [doi]
• On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric ObjectsTimothy M. Chan, Chaya Keller, Shakhar Smorodinsky. [doi]
• Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to PracticeLuca Castelli Aleardi, Éric Fusy, Jyh-Chwen Ko, Razvan-Stefan Puscasu. [doi]
• When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance ViolationsMatthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan 0001, Saket Saurabh 0001. [doi]
• Finding Shortest Reconfiguration Sequences for Modular Robots (Media Exposition)UML Modular Robotics Group, Hugo A. Akitaya, Andrew Clements, Sam Downey, Jonathan Eisenbies, Soham Samanta, Gabriel Shahrouzi, Frederick Stock. [doi]
• Approximating Klee's Measure Problem and a Lower Bound for Union Volume EstimationKarl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang. [doi]
• Tiling with Three Polygons Is UndecidableErik D. Demaine, Stefan Langerman. [doi]
• A Subquadratic Algorithm for Computing the L₁-Distance Between Two TerrainsPankaj K. Agarwal, Boris Aronov, Olivier Devillers, Christian Knauer, Guillaume Moroz. [doi]
• Finding a Shortest Curve That Separates Few Objects from ManyTherese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote. [doi]
• Sparse Bounded Hop-Spanners for Geometric Intersection GraphsSujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth. [doi]
• A Note on the No-(d+2)-On-a-Sphere ProblemAndrew Suk, Ethan Patrick White. [doi]
• Geometric Spanners of Bounded Tree-WidthKevin Buchin, Carolin Rehs, Torben Scheele. [doi]
• The Maximum Clique Problem in a Disk Graph Made EasyJ. Mark Keil, Debajyoti Mondal. [doi]
• When Alpha-Complexes Collapse onto Codimension-1 SubmanifoldsDominique Attali, Mattéo Clémot, Bianca B. Dornelas, André Lieutier. [doi]
• Tracking the Persistence of Harmonic Chains: Barcode and StabilityTao Hou 0002, Salman Parsa, Bei Wang 0001. [doi]
• On Spheres with k Points InsideHerbert Edelsbrunner, Alexey Garber, Morteza Saghafian. [doi]
• Sublinear Data Structures for Nearest Neighbor in Ultra High DimensionsMartin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma 0001, Zihang Wu. [doi]
• A Practical Algorithm for Knot FactorisationAlexander He 0001, Eric Sedgwick, Jonathan Spreer. [doi]
• On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other ApplicationsArnold Filtser. [doi]
• Polynomial-Time Algorithms for Contiguous Art Gallery and Related ProblemsAhmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas C. Shermer, Jack Spalding-Jamieson, Rolf Svenning, Da-Wei Zheng. [doi]
• Efficient Greedy Discrete Subtrajectory ClusteringIvor van der Hoog, Lara Ost, Eva Rotenberg, Daniel Rutschmann. [doi]
• Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1DLotte Blank, Jacobus Conradi, Anne Driemel, Benedikt Kolbe, André Nusser, Marena Richter. [doi]
• Extremal Betti Numbers and Persistence in Flag ComplexesLies Beers, Magnus Bakke Botnan. [doi]
• Incremental Planar Nearest Neighbor Queries with Optimal Query TimeJohn Iacono, Yakov Nekrich. [doi]
• Dynamic Maximum Depth of Geometric ObjectsSubhash Suri, Jie Xue 0003, Xiongxin Yang, Jiumu Zhu. [doi]
• Computing Oriented Spanners and Their DilationKevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong. [doi]
• Banana Trees for the Persistence in Time Series ExperimentallyLara Ost, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner. [doi]
• French Onion Soup, Ipelets for Points and Polygons (Media Exposition)Klint Faber, Auguste H. Gezalyan, Adam Martinson, Aniruddh Mutnuru, Nithin Parepally, Ryan Parker, Mihil Sreenilayam, Aram Zaprosyan, David M. Mount. [doi]
• AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition)Matthias Artmann, Tobias Maurer, Andreas Padalkin, Daniel Warner 0001, Christian Scheideler. [doi]
• The Fréchet Distance Unleashed: Approximating a Dog with a FrogSariel Har-Peled, Benjamin Raichel, Eliot W. Robson. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Shelling and Sinking Graphs on the SphereJeff Erickson 0001, Christian Howard. [doi]
• Geometric Bipartite Matching Based Exact Algorithms for Server ProblemsSharath Raghvendra, Pouyan Shirzadian, Rachita Sowle. [doi]
• Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple SettingsMikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz 0001, Jack Stade. [doi]
• Convexity Helps Iterated Search in 3DPeyman Afshani, Yakov Nekrich, Frank Staals. [doi]
• Persistent (Co)Homology in Matrix Multiplication TimeDmitriy Morozov, Primoz Skraba. [doi]
• Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing NumbersElizaveta Streltsova, Uli Wagner 0001. [doi]
• An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti NumberColleen Delaney, Clément Maria, Eric Samperton. [doi]
• p MetricsRobert Krauthgamer, Nir Petruschka. [doi]
• An 11/6-Approximation Algorithm for Vertex Cover on String GraphsÉdouard Bonnet, Pawel Rzazewski. [doi]
• Geometric Realizations of Dichotomous Ordinal GraphsPatrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann 0001, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, Antonios Symvonis. [doi]
• Incremental Algorithm and Local Search for Minimum Non-Obtuse Triangulations (CG Challenge)Taehoon Ahn 0001, Jaegun Lee, Byeonguk Kang, Hwi Kim. [doi]
• The Maximum Number of Digons Formed by Pairwise Intersecting PseudocirclesEyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay. [doi]
• Improved Approximation Algorithms for Three-Dimensional KnapsackKlaus Jansen, Debajyoti Kar, Arindam Khan 0001, K. V. N. Sreenivas, Malte Tutas. [doi]
• Sparsification of the Generalized Persistence Diagrams for Scalability Through Gradient DescentMathieu Carrière, Seunghyun Kim, Woojin Kim 0001. [doi]
• Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor FrameworkSang Won Bae 0001, Nicolau Oliver, Evanthia Papadopoulou. [doi]
• Recognizing 2-Layer and Outer k-Planar GraphsYasuaki Kobayashi, Yuto Okada, Alexander Wolff 0001. [doi]
• Uniform Bounds on Product Sylvester-Gallai ConfigurationsAbhibhav Garg, Rafael Oliveira 0002, Akash Kumar Sengupta. [doi]
• Structure and Independence in Hyperbolic Uniform Disk GraphsThomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen. [doi]
• Single-Source Shortest Path Problem in Weighted Disk GraphsShinwoo An, Eunjin Oh 0001, Jie Xue 0003. [doi]
• On the Twin-Width of Smooth ManifoldsÉdouard Bonnet, Kristóf Huszár. [doi]
• A PTAS for TSP with Neighbourhoods over Parallel Line SegmentsBenyamin Ghaseminia, Mohammad R. Salavatipour. [doi]
• Steinhaus Filtration and Stable Paths in the MapperDustin L. Arendt, Matthew Broussard, Bala Krishnamoorthy, Nathaniel Saul, Amber Thrall. [doi]
• Rapid Mixing of the Flip Chain over Non-Crossing Spanning TreesKonrad Anand, Weiming Feng 0001, Graham Freifeld, Heng Guo 0001, Mark Jerrum, Jiaheng Wang 0002. [doi]
• Polychromatic Coloring of Tuples in HypergraphsAhmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Milos Stojakovic. [doi]
• Range Counting Oracles for Geometric ProblemsAnne Driemel, Morteza Monemizadeh, Eunjin Oh 0001, Frank Staals, David P. Woodruff. [doi]
• A Minor-Testing Approach for Coordinated Motion Planning with Sliding RobotsEduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan 0001. [doi]