Abstract is missing.
- Throwing a Sofa Through the WindowDan Halperin, Micha Sharir, Itay Yehuda. [doi]
- Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse TheoryRanita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian. [doi]
- Complexity of Maximum Cut on Interval GraphsRanendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy. [doi]
- On the Edge Crossings of the Greedy SpannerDavid Eppstein, Hadi Khodabandeh. [doi]
- Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under TranslationKarl Bringmann, André Nusser. [doi]
- An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition)Fred Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, David Wisnosky. [doi]
- Parameterized Complexity of Quantum Knot InvariantsClément Maria. [doi]
- On Rich Lenses in Planar Arrangements of Circles and Related ProblemsEsther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl. [doi]
- A Stepping-Up Lemma for Topological Set SystemsXavier Goaoc, Andreas F. Holmsen, Zuzana Patáková. [doi]
- Characterizing Universal Reconfigurability of Modular Pivoting RobotsHugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán. [doi]
- Restricted Constrained Delaunay TriangulationsMarc Khoury, Jonathan Richard Shewchuk. [doi]
- Sunflowers in Set Systems of Bounded DimensionJacob Fox, János Pach, Andrew Suk. [doi]
- Rectilinear Steiner Trees in Narrow StripsHenk Alkema, Mark de Berg. [doi]
- Reliable Spanners for Metric SpacesSariel Har-Peled, Manor Mendel, Dániel Oláh. [doi]
- On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack ProblemArindam Khan 0001, Arnab Maiti, Amatya Sharma, Andreas Wiese. [doi]
- Classifying Convex Bodies by Their Contact and Intersection GraphsAnders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen. [doi]
- Optimal Bounds for the Colorful Fractional Helly TheoremDenys Bulavka, Afshin Goodarzi, Martin Tancer. [doi]
- Faster Algorithms for Largest Empty Rectangles and BoxesTimothy M. Chan. [doi]
- More Dynamic Data Structures for Geometric Set Cover with Sublinear Update TimeTimothy M. Chan, Qizheng He. [doi]
- Online Packing to Minimize Area or PerimeterMikkel Abrahamsen, Lorenzo Beretta. [doi]
- Geometric Algorithms for Sampling the Flux Space of Metabolic NetworksApostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas, Haris Zafeiropoulos. [doi]
- Combinatorial Resultants in the Algebraic Rigidity MatroidGoran Malic, Ileana Streinu. [doi]
- Lower Bounds for Semialgebraic Range Searching and Stabbing ProblemsPeyman Afshani, Pingan Cheng. [doi]
- The Density Fingerprint of a Periodic Point SetHerbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken. [doi]
- Colouring Polygon Visibility Graphs and Their GeneralizationsJames Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak. [doi]
- Light Euclidean Steiner Spanners in the PlaneSujoy Bhore, Csaba D. Tóth. [doi]
- A Parallel Batch-Dynamic Data Structure for the Closest Pair ProblemYiqiu Wang, Shangdi Yu, Yan Gu 0001, Julian Shun. [doi]
- Packing Squares into a Disk with Optimal Worst-Case DensitySándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer. [doi]
- Computing the Multicover BifiltrationRené Corbet, Michael Kerber, Michael Lesnick, Georg Osang. [doi]
- Approximate Nearest-Neighbor Search for Line SegmentsAhmed Abdelkader, David M. Mount. [doi]
- An Integer Programming Formulation Using Convex Polygons for the Convex Partition ProblemHadrien Cambazard, Nicolas Catusse. [doi]
- Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn TriangulationsJean-Daniel Boissonnat, Siargey Kachanovich, Mathijs Wintraecken. [doi]
- A Sparse Delaunay FiltrationDonald R. Sheehy. [doi]
- An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple PolygonsHaitao Wang 0001. [doi]
- On Ray Shooting for Triangles in 3-Space and Related ProblemsEsther Ezra, Micha Sharir. [doi]
- Strong Hanani-Tutte for the TorusRadoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer. [doi]
- Polygon-Universal GraphsTim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek. [doi]
- Stabbing Convex Bodies with Lines and FlatsSariel Har-Peled, Mitchell Jones. [doi]
- On Rich Points and Incidences with Restricted Sets of Lines in 3-SpaceMicha Sharir, Noam Solomon. [doi]
- Computing Zigzag Persistence on Graphs in Near-Linear TimeTamal K. Dey, Tao Hou. [doi]
- Approximate Range Counting Under Differential PrivacyZiyue Huang, Ke Yi 0001. [doi]
- A Family of Metrics from the Truncated Smoothing of Reeb GraphsErin Wolf Chambers, Elizabeth Munch, Tim Ophelders. [doi]
- Two-Sided Kirszbraun TheoremArturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev. [doi]
- Adjacency Graphs of Polyhedral SurfacesElena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz 0001, Birgit Vogtenhuber, Alexander Wolff 0001. [doi]
- Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and MoreWaldo Gálvez, Fabrizio Grandoni 0001, Arindam Khan 0001, Diego Ramírez-Romero, Andreas Wiese. [doi]
- A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge)Hyeyun Yang, Antoine Vigneron. [doi]
- On Laplacians (Invited Talk)Robert Ghrist. [doi]
- Convergence of Gibbs Sampling: Coordinate Hit-And-Run Mixes FastAditi Laddha, Santosh S. Vempala. [doi]
- Efficient Generation of Rectangulations via Permutation LanguagesArturo I. Merino, Torsten Mütze. [doi]
- Sublinear Average-Case Shortest Paths in Weighted Unit-Disk GraphsAdam Karczmarz, Jakub Pawlewicz, Piotr Sankowski. [doi]
- Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade 0001, Luc Libralesso. [doi]
- Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their ApplicationsMónika Csikós, Nabil H. Mustafa. [doi]
- Orientation Preserving Maps of the Square GridImre Bárány, Attila Pór, Pavel Valtr. [doi]
- Near Neighbor Search via Efficient Average Distortion EmbeddingsDeepanshu Kush, Aleksandar Nikolov, Haohua Tang. [doi]
- On Undecided LP, Clustering and Active LearningStav Ashur, Sariel Har-Peled. [doi]
- Sketching Persistence DiagramsDonald R. Sheehy, Siddharth Sheth. [doi]
- Algorithms for Contractibility of Compressed Curves on 3-Manifold BoundariesErin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa. [doi]
- Minimal Delaunay Triangulations of Hyperbolic SurfacesMatthijs Ebbens, Hugo Parlier, Gert Vegter. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- A Practical Algorithm with Performance Guarantees for the Art Gallery ProblemSimon B. Hengeveld, Tillmann Miltzow. [doi]
- Coordinated Motion Planning Through Randomized k-Opt (CG Challenge)Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da-Wei Zheng. [doi]
- Approximating the (Continuous) Fréchet DistanceConnor Colombe, Kyle Fox. [doi]
- 3SUM and Related Problems in Fine-Grained Complexity (Invited Talk)Virginia Vassilevska Williams. [doi]
- No Krasnoselskii Number for General SetsChaya Keller, Micha A. Perles. [doi]
- Chasing Puppies: Mobile Beacon Routing on Closed CurvesMikkel Abrahamsen, Jeff Erickson 0001, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta. [doi]
- Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition)Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, Arne Schmidt 0001. [doi]