default search action
39th SoCG 2023: Dallas, TX, USA
- Erin W. Chambers
, Joachim Gudmundsson
39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. LIPIcs 258, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-273-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Mikkel Abrahamsen
Geometric Embeddability of Complexes Is ∃ℝ-Complete. 1:1-1:19 - Mikkel Abrahamsen
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. 2:1-2:16 - Peyman Afshani, Pingan Cheng:
Lower Bounds for Intersection Reporting Among Flat Objects. 3:1-3:16 - Pankaj K. Agarwal, Sariel Har-Peled
Computing Instance-Optimal Kernels in Two Dimensions. 4:1-4:15 - Pankaj K. Agarwal, Esther Ezra:
Line Intersection Searching Amid Unit Balls in 3-Space. 5:1-5:14 - Oswin Aichholzer
Drawings of Complete Multipartite Graphs up to Triangle Flips. 6:1-6:16 - Ángel Javier Alonso, Michael Kerber:
Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets. 7:1-7:16 - Gergely Ambrus, Martin Balko
On Helly Numbers of Exponential Lattices. 8:1-8:16 - Sunil Arya, David M. Mount
Optimal Volume-Sensitive Bounds for Polytope Approximation. 9:1-9:16 - Sayan Bandyapadhyay, Fedor V. Fomin
Coresets for Clustering in Geometric Intersection Graphs. 10:1-10:16 - Sayan Bandyapadhyay, William Lochet
Minimum-Membership Geometric Set Cover, Revisited. 11:1-11:14 - Sayan Bandyapadhyay, William Lochet
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. 12:1-12:14 - J. Andreas Bærentzen
Multilevel Skeletonization Using Local Separators. 13:1-13:18 - Ulrich Bauer
Efficient Computation of Image Persistence. 14:1-14:14 - Ulrich Bauer
Efficient Two-Parameter Persistence Computation via Cohomology. 15:1-15:17 - Sarita de Berg
The Complexity of Geodesic Spanners. 16:1-16:16 - Helena Bergold
An Extension Theorem for Signotopes. 17:1-17:14 - Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. 18:1-18:16 - Ahmad Biniaz:
Improved Bounds for Covering Paths and Trees in the Plane. 19:1-19:15 - Mickaël Buchet, Bianca B. Dornelas, Michael Kerber:
Sparse Higher Order Čech Filtrations. 20:1-20:17 - Benjamin A. Burton
Finding Large Counterexamples by Selectively Exploring the Pachner Graph. 21:1-21:16 - Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. 22:1-22:16 - Timothy M. Chan, Zhengcheng Huang:
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. 23:1-23:16 - Timothy M. Chan:
Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. 24:1-24:13 - Nate Clause, Tamal K. Dey, Facundo Mémoli, Bei Wang:
Meta-Diagrams for 2-Parameter Persistence. 25:1-25:16 - Vincent Delecroix, Matthijs Ebbens, Francis Lazarus, Ivan Yakovlev:
Algorithms for Length Spectra of Combinatorial Tori. 26:1-26:16 - Vincent Despré, Benedikt Kolbe, Hugo Parlier, Monique Teillaud:
Computing a Dirichlet Domain for a Hyperbolic Surface. 27:1-27:15 - Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. 28:1-28:16 - David Eppstein:
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. 29:1-29:16 - Jared Espenant, J. Mark Keil, Debajyoti Mondal:
Finding a Maximum Clique in a Disk Graph. 30:1-30:17 - Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder
Linear Size Universal Point Sets for Classes of Planar Graphs. 31:1-31:16 - Thomas Fernique, Daria Pchelina:
When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and Techniques. 32:1-32:17 - Arnold Filtser:
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. 33:1-33:18 - Esther Galby, Andrea Munaro
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. 34:1-34:15 - Auguste H. Gezalyan, David M. Mount
Voronoi Diagrams in the Hilbert Metric. 35:1-35:16 - Egor Gorbachev
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d ≥ 4. 36:1-36:14 - Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, Yusu Wang:
A Generalization of the Persistent Laplacian to Simplicial Maps. 37:1-37:17 - Pepijn Roos Hoefgeest, Lucas Slot:
The Christoffel-Darboux Kernel for Topological Data Analysis. 38:1-38:20 - Michael Hoffmann, Meghana M. Reddy:
The Number of Edges in Maximal 2-Planar Graphs. 39:1-39:15 - Jacob Holm, Ivor van der Hoog
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. 40:1-40:18 - Alfredo Hubard, Andrew Suk:
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems. 41:1-41:15 - Kristóf Huszár
On the Width of Complicated JSJ Decompositions. 42:1-42:18 - Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of Colorings in Triangulations of the Sphere. 43:1-43:16 - Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the Geometric Thickness of 2-Degenerate Graphs. 44:1-44:15 - Michael Kerber, Matthias Söls:
The Localized Union-Of-Balls Bifiltration. 45:1-45:19 - Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. 46:1-46:17 - Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. 47:1-47:17 - Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira
Shortest Paths in Portalgons. 48:1-48:16 - Anna Lubiw, Anurag Murty Naredla:
The Geodesic Edge Center of a Simple Polygon. 49:1-49:15 - Corentin Lunel, Arnaud de Mesmay:
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. 50:1-50:16 - Facundo Mémoli, Ling Zhou:
Ephemeral Persistence Features and the Stability of Filtered Chain Complexes. 51:1-51:18 - Evanthia Papadopoulou
Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and Applications. 52:1-52:16 - Ioannis Psarros, Dennis Rohde:
Random Projections for Curves in High Dimensions. 53:1-53:15 - Benjamin Qi, Richard Qi:
New Approximation Algorithms for Touring Regions. 54:1-54:16 - Patrick Schnider
Combinatorial Depth Measures for Hyperplane Arrangements. 55:1-55:14 - Luis Scoccola, Jose A. Perea:
FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles. 56:1-56:18 - Luis Scoccola, Hitesh Gakhar, Johnathan Bush, Nikolas Schonsheck, Tatum Rask, Ling Zhou, Jose A. Perea:
Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice Reduction. 57:1-57:20 - Jack Stade, Jamie Tucker-Foltz:
Topological Universality of the Art Gallery Problem. 58:1-58:13 - Andrew Suk, Ji Zeng:
On Higher Dimensional Point Sets in General Position. 59:1-59:13 - Hubert Wagner:
Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data. 60:1-60:16 - Honglin Zhu, Hyuk Jun Kweon
Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under Translation. 61:1-61:16 - Richard Berger, Vincent Ha, David Kratz, Michael Lin, Jeremy Moyer, Christopher J. Tralie:
Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition). 62:1-62:3 - Alexandra Camero, Ileana Streinu:
Interactive 2D Periodic Graphs (Media Exposition). 63:1-63:4 - Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Greedy Permutations and Finite Voronoi Diagrams (Media Exposition). 64:1-64:5 - Donald R. Sheehy:
The Sum of Squares in Polycubes (Media Exposition). 65:1-65:6 - Mikkel Abrahamsen
Constructing Concise Convex Covers via Clique Covers (CG Challenge). 66:1-66:9 - Guilherme Dias da Fonseca:
Shadoks Approach to Convex Covering (CG Challenge). 67:1-67:9
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 2024-11-27 20:16 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: