| 2019 | 3-Manifold Triangulations with Small Treewidth. Kristóf Huszár, Jonathan Spreer |
| 2019 | 35th International Symposium on Computational Geometry, SoCG 2019, Portland, Oregon, USA, June 18-21, 2019 Gill Barequet, Yusu Wang |
| 2019 | A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. Haitao Wang |
| 2019 | A Geometric Data Structure from Neuroscience (Invited Talk). Sanjoy Dasgupta |
| 2019 | A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition). Maarten Löffler |
| 2019 | A New Lower Bound for Semigroup Orthogonal Range Searching. Peyman Afshani |
| 2019 | A Product Inequality for Extreme Distances. Adrian Dumitrescu |
| 2019 | A Spanner for the Day After. Kevin Buchin, Sariel Har-Peled, Dániel Oláh |
| 2019 | A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. Nathaniel Lahn, Sharath Raghvendra |
| 2019 | Algorithms for Metric Learning via Contrastive Embeddings. Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos |
| 2019 | Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay |
| 2019 | An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl |
| 2019 | An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud |
| 2019 | Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera |
| 2019 | Chunk Reduction for Multi-Parameter Persistent Homology. Ulderico Fugacci, Michael Kerber |
| 2019 | Circumscribing Polygons and Polygonizations for Disjoint Line Segments. Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth |
| 2019 | Computing Persistent Homology of Flag Complexes via Strong Collapses. Jean-Daniel Boissonnat, Siddharth Pritam |
| 2019 | Computing Shapley Values in the Plane. Sergio Cabello, Timothy M. Chan |
| 2019 | Connecting the Dots (with Minimum Crossings). Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi |
| 2019 | Convex Polygons in Cartesian Products. Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot |
| 2019 | Counting Polygon Triangulations is Hard. David Eppstein |
| 2019 | Cubic Planar Graphs That Cannot Be Drawn On Few Lines. David Eppstein |
| 2019 | DTM-Based Filtrations. Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda |
| 2019 | Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges. Yufei Tao, Yu Wang |
| 2019 | Dual Circumference and Collinear Sets. Vida Dujmovic, Pat Morin |
| 2019 | Dynamic Geometric Data Structures via Shallow Cuttings. Timothy M. Chan |
| 2019 | Dynamic Planar Point Location in External Memory. J. Ian Munro, Yakov Nekrich |
| 2019 | Efficient Algorithms for Geometric Partial Matching. Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao |
| 2019 | Efficient Algorithms for Ortho-Radial Graph Drawing. Benjamin Niedermann, Ignaz Rutter, Matthias Wolf |
| 2019 | Exact Computation of the Matching Distance on 2-Parameter Persistence Modules. Michael Kerber, Michael Lesnick, Steve Oudot |
| 2019 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2019 | Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition). Peter Schäfer |
| 2019 | General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl |
| 2019 | Ham-Sandwich Cuts and Center Transversals in Subspaces. Patrick Schnider |
| 2019 | Independent Range Sampling, Revisited Again. Peyman Afshani, Jeff M. Phillips |
| 2019 | Journey to the Center of the Point Set. Sariel Har-Peled, Mitchell Jones |
| 2019 | Lower Bounds for Electrical Reduction on Surfaces. Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson |
| 2019 | Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer |
| 2019 | Morphing Contact Representations of Graphs. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli |
| 2019 | Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Haitao Wang, Jie Xue |
| 2019 | On Grids in Point-Line Arrangements in the Plane. Mozhgan Mirzaei, Andrew Suk |
| 2019 | On Weak epsilon-Nets and the Radon Number. Shay Moran, Amir Yehudayoff |
| 2019 | On the Chromatic Number of Disjointness Graphs of Curves. János Pach, István Tomon |
| 2019 | On the Complexity of the k-Level in Arrangements of Pseudoplanes. Micha Sharir, Chen Ziv |
| 2019 | On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces. Mathieu Carrière, Ulrich Bauer |
| 2019 | Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams. Luis Barba |
| 2019 | Packing Disks into Disks with Optimal Worst-Case Density. Sándor P. Fekete, Phillip Keldenich, Christian Scheffer |
| 2019 | Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer |
| 2019 | Polyline Simplification has Cubic Complexity. Karl Bringmann, Bhaskar Ray Chaudhury |
| 2019 | Preconditioning for the Geometric Transportation Problem. Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov |
| 2019 | Preprocessing Ambiguous Imprecise Points. Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann |
| 2019 | Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient Sampling. Amer Krivosija, Alexander Munteanu |
| 2019 | Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition). Gill Barequet, Gil Ben-Shachar |
| 2019 | Rods and Rings: Soft Subdivision Planner for R^3 x S^2. Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap |
| 2019 | Searching for the Closest-Pair in a Query Translate. Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan |
| 2019 | Semi-Algebraic Colorings of Complete Graphs. Jacob Fox, János Pach, Andrew Suk |
| 2019 | Smallest k-Enclosing Rectangle Revisited. Timothy M. Chan, Sariel Har-Peled |
| 2019 | Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk). Bruce Randall Donald |
| 2019 | The Crossing Tverberg Theorem. Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner |
| 2019 | The One-Way Communication Complexity of Dynamic Time Warping Distance. Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang |
| 2019 | The Unbearable Hardness of Unknotting. Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer |
| 2019 | The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances. Anne Driemel, Jeff M. Phillips, Ioannis Psarros |
| 2019 | Topological Data Analysis in Information Space. Herbert Edelsbrunner, Ziga Virk, Hubert Wagner |
| 2019 | Topologically Trivial Closed Walks in Directed Surface Graphs. Jeff Erickson, Yipu Wang |
| 2019 | Upward Book Embeddings of st-Graphs. Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani |
| 2019 | Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. Karl Bringmann, Marvin Künnemann, André Nusser |
| 2019 | When Convexity Helps Collapsing Complexes. Dominique Attali, André Lieutier, David Salinas |
| 2019 | Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. Radoslav Fulek, Jan Kyncl |