default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd SoCG 2026: New Brunswick, NJ, USA
- Hee-Kap Ahn
, Michael Hoffmann, Amir Nayyeri:
42nd International Symposium on Computational Geometry, SoCG 2026, New Brunswick, NJ, USA, June 2-5, 2026. LIPIcs 367, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-418-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxiv
- Anders Aamand, Mikkel Abrahamsen, Reilly Browne, Mayank Goswami, Prahlad Narasimhan Kasthurirangan, Linda Kleist, Joseph S. B. Mitchell, Valentin Polishchuk, Jack Stade:
Covering and Partitioning Complex Objects with Small Pieces. 1:1-1:16 - Eyal Ackerman, Balázs Keszegh:
On the Maximum Number of Tangencies Among 1-Intersecting Curves. 2:1-2:15 - Henry Adams, Sushovan Majhi, Fedor Manin, Ziga Virk, Nicolò Zava:
Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs. 3:1-3:16 - Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
Dynamic Nearest-Neighbor Searching Under General Metrics in ℝ³ and Its Applications. 4:1-4:15 - Ángel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick, Abhishek Rathod:
Bifunction and Interlevel Delaunay Trifiltrations. 5:1-5:20 - Ethan André, Jingyi Li, David Loiseaux, Steve Oudot:
Estimating the Persistent Homology of ℝⁿ-Valued Functions Using Function-Geometric Multifiltrations. 6:1-6:18 - Sebastian Angrick, Kevin Buchin, Geri Gokaj, Marvin Künnemann:
Computing L∞ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness. 7:1-7:15 - Sunil Arya, David M. Mount:
Cauchy's Surface Area Formula in the Funk Geometry. 8:1-8:18 - Sergey Avvakumov, Marguerite Bin, Xavier Goaoc:
Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions. 9:1-9:16 - Ulrich Bauer, Tamal K. Dey, Michael Kerber, Florian Russold, Matthias Söls:
Fast Free Resolutions of Bifiltered Chain Complexes. 10:1-10:21 - Thijs Beurskens, Tim Ophelders, Bettina Speckmann, Kevin Verbeek:
Locally Correct Interleavings Between Merge Trees. 11:1-11:15 - Sujoy Bhore, Karl Bringmann, Timothy M. Chan, Yanheng Wang:
Dynamic and Streaming Algorithms for Union Volume Estimation. 12:1-12:15 - Sujoy Bhore, Jonathan Conroy, Arnold Filtser:
Dynamic Light Spanners in Doubling Metrics. 13:1-13:16 - Sujoy Bhore, Anupam Gupta, Amit Kumar:
Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems. 14:1-14:14 - Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenkovic, Csaba D. Tóth, Karol Wegrzycki, Sampson Wong:
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity. 15:1-15:18 - Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber:
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds. 16:1-16:18 - Lotte Blank:
Fréchet Distance in the Imbalanced Case. 17:1-17:17 - Thomas Bläsius, Emil Dohse, Deborah Haun, Laura Merker:
Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs. 18:1-18:17 - Michaela Borzechowski, Sebastian Haslebacher, Hung P. Hoang, Patrick Schnider, Simon Weber:
Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements. 19:1-19:16 - Prosenjit Bose, Jean-Lou De Carufel, John Stuart, Darryl Hill:
The Spanning Ratio of the Directed Θ₆-Graph Is 5. 20:1-20:18 - Sofia Brenner, Petr Gregor, Torsten Mütze, Francesco Verciani:
On Minimum Venn Diagrams. 21:1-21:18 - Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck, Francesco Verciani:
Disproving Two Conjectures on the Hamiltonicity of Venn Diagrams. 22:1-22:16 - Bruce W. Brewer, Haitao Wang:
Shortest Paths in Geodesic Unit-Disk Graphs. 23:1-23:15 - Reilly Browne, Hsien-Chih Chang:
Single-Criteria Metric r-Dominating Set Problem via Minor-Preserving Support. 24:1-24:17 - Denys Bulavka, Eran Nevo, Yuval Peled:
The Typical Algebraic Shifting of Graphs and Surfaces. 25:1-25:15 - Guangya Cai:
Finding a Fair Scoring Function for Top-k Selection: From Hardness to Practice. 26:1-26:17 - Zixi Cai, Kuowen Chen, Shengquan Du, Arnold Filtser, Seth Pettie, Daniel Skora:
The Squishy Grid Problem. 27:1-27:16 - Timothy M. Chan:
Triangulating a Polygon with Holes in Optimal (Deterministic) Time. 28:1-28:13 - Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng:
Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above. 29:1-29:15 - Timothy M. Chan, Yuancheng Yu:
Computing the Girth of a Segment Intersection Graph. 30:1-30:16 - Chaeyoon Chung, Anil Maheshwari, Michiel Smid:
Linear-Time (1+ε)-Approximation Algorithms for Two-Line-Center Problems. 31:1-31:17 - Jessi Cisewski-Kehe, Brittany Terese Fasy, Alexander McCleary, Eli Quist:
Tensor Computation of Euler Characteristic Functions and Transforms. 32:1-32:17 - Vincent Cohen-Addad, Karthik C. S., David Saulpic, Chris Schwiegelshohn:
Near-Optimal Bounds for Parameterized Euclidean k-Means. 33:1-33:17 - Vincent Cohen-Addad, Karthik C. S., David Saulpic, Chris Schwiegelshohn:
Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces. 34:1-34:16 - Jacobus Conradi, Ivor van der Hoog, Eva Rotenberg:
On Computing the (Exact) Fréchet Distance with a Frog. 35:1-35:20 - Giordano Da Lozzo, Fabrizio Frati, Ignaz Rutter:
Upward Book Embeddings of Partitioned Digraphs. 36:1-36:18 - Hana Dal Poz Kourimská, André Lieutier, Mathijs Wintraecken:
A Free Lunch: Manifolds of Positive Reach Can Be Smoothed Without Decreasing the Reach. 37:1-37:19 - Vincent Delecroix, Oscar Fontaine, Arnaud de Mesmay:
On the Size of k-Irreducible Triangulations. 38:1-38:16 - Chengyuan Deng, Jie Gao, Kevin Lu, Feng Luo, Cheng Xin:
Locality Sensitive Hashing in Hyperbolic Space. 39:1-39:19 - Loïc Dubois:
Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface. 40:1-40:15 - Herbert Edelsbrunner, Michal Lipinski, Marian Mrozek, Manuel Soriano-Trigueros, Fedor Zimin:
The Depth Poset Under Transpositions in the Filter. 41:1-41:18 - Henrique Ennes, Clément Maria:
Compressed Data Structures for Heegaard Splitting. 42:1-42:15 - Tsuri Farhana, Omrit Filtser, Shalev Goldshtein:
Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-Offs. 43:1-43:16 - Sándor P. Fekete, Jonas Friemel, Peter Kramer, Jan-Marc Reinhardt, Christian Rieck, Christian Scheffer:
Tilt Automata: Gathering Particles with Uniform External Control. 44:1-44:19 - Sándor P. Fekete, Prahlad Narasimhan Kasthurirangan, Phillip Keldenich, Fabian Kollhoff, Chek-Manh Loi, Michael Perk:
Line Segment Visibility in Simple Polygons: Exact, Robust, Scalable Computation and Applications. 45:1-45:19 - Sándor P. Fekete, Rouven Kniep, Dominik Krupke, Michael Perk:
A Branch-And-Bound Algorithm for the Traveling Salesman Problem with Difficult Neighborhoods. 46:1-46:20 - Marc Fersztand, Jan Jendrysiak:
Computing the Skyscraper Invariant. 47:1-47:23 - Arnold Filtser, Ameet Gadekar:
FPT Approximations for Capacitated Sum of Radii and Diameters. 48:1-48:18 - Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh:
Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality. 49:1-49:15 - Jacob Fox, Jonathan Tidor:
Separators for Intersection Graphs of Spheres. 50:1-50:16 - Colin Geniet, Gunwoo Kim, Lucas Meijer:
First-Order Logic and Twin-Width for Some Geometric Graphs. 51:1-51:16 - Tim Gerlach, Benjamin Hennies, Linda Kleist:
Online Packing of Orthogonal Polygons. 52:1-52:17 - Anirban Ghosh:
Constructing Doppelgängers of Greedy Geometric Spanners in Practice. 53:1-53:21 - Geri Gokaj, Marvin Künnemann, Sabine Storandt, Carina Truschel:
Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution. 54:1-54:21 - Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Linear Time Single-Source Shortest Path Algorithms in Euclidean Graph Classes. 55:1-55:14 - Mustafa Alper Gunes, Assaf Naor:
Optimal Randomized Clustering of Matrices. 56:1-56:18 - Petar Hristov, Ingrid Hotz, Talha Bin Masood:
Singular Arrange and Traverse Algorithm for Computing Reeb Spaces of Bivariate PL Maps. 57:1-57:17 - Kristóf Huszár, Clément Maria:
On Sparse Representations of 3‑Manifolds. 58:1-58:18 - Yaara Jahn, Orit E. Raz:
Improved Bound for the k-Variate Elekes-Rónyai Theorem. 59:1-59:15 - Andreas Kalavas, Ioannis Psarros:
Space-Efficient Approximate Spherical Range Counting in High Dimensions. 60:1-60:15 - Chaya Keller, Micha A. Perles:
Complements of Finite Unions of Convex Sets. 61:1-61:18 - Michael Kerber, Elena Xinyi Wang:
Computing the Bottleneck Distance Between Persistent Homology Transforms. 62:1-62:15 - Balázs Keszegh, Andrew Suk, Gábor Tardos, Ji Zeng:
Unavoidable Patterns and Plane Paths in Dense Topological Graphs. 63:1-63:15 - Sándor Kisfaludi-Bak, Saeed Odak, Satyam Singh, Geert van Wordragen:
Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree. 64:1-64:17 - Sándor Kisfaludi-Bak, Geert van Wordragen:
Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces. 65:1-65:17 - Robert Krauthgamer, Nir Petruschka:
Fast Nearest Neighbor Search for ℓp Metrics. 66:1-66:9 - Andrey Kupavskii, János Pach:
Non-Dissective Coverings by Planks. 67:1-67:11 - An La, Hung Le, Shay Solomon, Cuong Than, Vinayak, Shuang Yang, Tianyi Zhang:
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics. 68:1-68:16 - Joost van der Laan, Frank Staals, Lorenzo Theunissen:
Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain. 69:1-69:16 - Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Tree-Like Shortcuttings of Trees. 70:1-70:15 - Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Approximating Euclidean Shallow-Light Trees. 71:1-71:16 - Jakub Leskiewicz, Bartosz Furmanek, Michal Lipinski, Dmitriy Morozov:
Topological Simplification Guided by Forbidden Regions. 72:1-72:17 - Shana Yunsheng Li:
The Complete 10-Tetrahedra Census of Orientable Cusped Hyperbolic 3-Manifolds. 73:1-73:15 - André Lieutier, Mathijs Wintraecken:
Manifolds of Positive Reach, Differentiability, Tangent Variation, and Attaining the Reach. 74:1-74:16 - André Lieutier, Mathijs Wintraecken:
Geodesics of Length Less Than πR in a Set of Reach R Are Unique and Continuous with Respect to the Endpoints. 75:1-75:12 - Clément Maria, Hoel Queffelec:
A Fast Algorithm for the Hecke Representation of the Braid Group, and Applications to the Computation of the HOMFLY-PT Polynomial and the Search for Interesting Braids. 76:1-76:18 - Malory Marin, Jean-Florent Raymond, Rémi Watrigant:
Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs. 77:1-77:14 - Dhruv Meduri, Chuan-Shen Hu, Cong Shen, Kelin Xia, Bei Wang:
Mapping Chemical Space: Topological Data Analysis of Chemical Latent Space with Mapper. 78:1-78:20 - Soham Mukherjee, Shreyas N. Samaga, Cheng Xin, Steve Oudot, Tamal K. Dey:
D-GRIL: End-To-End Topological Learning with 2-Parameter Persistence. 79:1-79:17 - Alexander Munteanu, Simon Omlor, Jeff M. Phillips:
Hardness of High-Dimensional Linear Classification. 80:1-80:16 - Yakov Nekrich, Saladi Rahul:
Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model. 81:1-81:15 - Steve Oudot, Lukas Waas:
A Persistent Version of Latschev's Theorem. 82:1-82:17 - János Pach, Orit E. Raz, József Solymosi:
Erdős's Unit Distance Problem and Rigidity. 83:1-83:9 - Evanthia Papadopoulou, Zeyu Wang:
The Voronoi Diagram of Four Lines in ℝ³. 84:1-84:17 - Geevarghese Philip, Erlend Raa Vågset:
ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes. 85:1-85:19 - Orit E. Raz:
Expansion of Trivariate Polynomials Using Proximity. 86:1-86:10 - Pepijn Roos Hoefgeest, Lucas Slot:
Robustness of Persistent Topological Features and Minimum Homological Cuts. 87:1-87:15 - Shubhangi Saraf, Narmada Varadarajan:
Integer Points in Dilates of Polytopes. 88:1-88:9 - Thomas Schibler, Jie Xue, Jiumu Zhu:
Approximating Convex Hulls via Range Queries. 89:1-89:15 - Jonathan Richard Shewchuk:
Better Sampling Bounds for Restricted Delaunay Triangulations and a Star-Shaped Property for Restricted Voronoi Cells. 90:1-90:16 - Jonathan Richard Shewchuk, Sagnik Bhattacharya:
The Hierarchy of Manifolds in a Stratification of the Set of Equivalent Linear Neural Networks. 91:1-91:19 - Jérôme Taupin:
Estimation of Conformal Metrics. 92:1-92:15 - Raphaël Tinarrage:
Simplicial Approximation to CW Complexes with Spherical Delaunay Triangulations. 93:1-93:22 - Hubert Wagner, Nickolas Arustamyan, Matthew Wheeler, Peter Bubenik:
Mixup Barcodes: Quantifying Geometric-Topological Interactions Between Point Clouds. 94:1-94:19 - Haitao Wang:
An Optimal Algorithm for Computing Many Faces in Line Arrangements. 95:1-95:14 - Hugo A. Akitaya, Joseph Dorfer, Peter Kramer, Christian Rieck, Soham Samanta, Gabriel Shahrouzi, Frederick Stock:
Sliding Cubes in Parallel (Media Exposition). 96:1-96:5 - Oswin Aichholzer, Hugo A. Akitaya, Anna Brötzner, Peter Kramer, Christian Rieck, Frederick Stock:
"Visualizing" the CG Community (Media Exposition). 97:1-97:4 - Carlos Alegría, Ioannis Mantas, Marko Savic, Martin Suderland:
Interactive Uniform Floodlight Illumination and Rotating Rays Voronoi Diagrams (Media Exposition). 98:1-98:7 - Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan, Danesh Sivakumar, Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, David M. Mount:
Proximity Alert: Ipelets for Neighborhood Graphs and Clustering (Media Exposition). 99:1-99:8 - Hridhaan Banerjee, Soren Brown, June Cagan, Auguste H. Gezalyan, Megan Hunleth, Veena Kailad, Chaewoon Kyoung, Rowan Shigeno, Yasmine Tajeddin, Andrew Wagger, Kelin Zhu, David M. Mount:
Visualizing Higher Order Structures, Overlap Regions, and Clustering in the Hilbert Geometry (Media Exposition). 100:1-100:6 - Batsambuu Batbold, Lori Ziegelmeier:
From Chaos to Continents: Voronoi-Based Procedural Terrain Generation with Hydrology and 3D Visualization (Media Exposition). 101:1-101:7 - Sándor P. Fekete, Malte Hoffmann, Chek-Manh Loi, Michael Perk:
Tracking a Set of Moving Objects with Minimal Peak Power (Media Exposition). 102:1-102:7 - Sándor P. Fekete, Phillip Keldenich, Michael Perk, Tobias Wallner:
Scalable Algorithmic Methods for Simulating Heavy-Rain Events (Media Exposition). 103:1-103:6 - Soham Samanta, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine:
Interactive Visualization and Verification Tools for Tesseract Path Unfoldings (Media Exposition). 104:1-104:5 - Lorenzo Battini, Marko Milenkovic:
ETH Flippers Approach to Parallel Reconfiguration of Triangulations: SAT Formulation and Heuristics (CG Challenge). 105:1-105:6 - Jacobus Conradi, Benedikt Kolbe, Philip Mayer, Jonas Sauer, Jack Spalding-Jamieson:
Engineering Greedy Heuristics and Simulated Annealing Methods for the Median Triangulation Under the Parallel Flip Distance (CG Challenge). 106:1-106:7 - Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard:
Shadoks Approach to Parallel Reconfiguration of Triangulations (CG Challenge). 107:1-107:7 - Jaegun Lee, Seokyun Kang, Hyeonseok Lee, Hyeyun Yang, Taehoon Ahn:
CG#Hunters Approach to Central Triangulation Under Parallel Flip Operations (CG Challenge). 108:1-108:8
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-31 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
