default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th SoCG 2022: Berlin, Germany
- Xavier Goaoc, Michael Kerber
:
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany. LIPIcs 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-227-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. 1:1-1:17 - Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. 2:1-2:14 - Peyman Afshani, Pingan Cheng:
On Semialgebraic Range Reporting. 3:1-3:14 - Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. 4:1-4:14 - Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger:
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. 5:1-5:18 - Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber:
Edge Partitions of Complete Geometric Graphs. 6:1-6:16 - Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. 7:1-7:18 - Dominique Attali, André Lieutier:
Delaunay-Like Triangulation of Smooth Orientable Submanifolds by ℓ1-Norm Minimization. 8:1-8:16 - Håvard Bakke Bjerkevik:
Tighter Bounds for Reconstruction from ε-Samples. 9:1-9:17 - Martin Balko, Manfred Scheucher, Pavel Valtr:
Erdős-Szekeres-Type Problems in the Real Projective Plane. 10:1-10:15 - Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. 11:1-11:16 - Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot:
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. 12:1-12:16 - Yair Bartal, Ora Nova Fandina, Kasper Green Larsen:
Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. 13:1-13:16 - Ulrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr:
Quasi-Universality of Reeb Graph Distances. 14:1-14:18 - Ulrich Bauer, Fabian Roll:
Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips Filtrations. 15:1-15:15 - Ahmad Biniaz:
Acute Tours in the Plane. 16:1-16:8 - Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset:
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. 17:1-17:16 - Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts:
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. 18:1-18:15 - Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot:
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions. 19:1-19:18 - Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. 20:1-20:17 - Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian:
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. 21:1-21:16 - Kevin Buchin, André Nusser, Sampson Wong:
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. 22:1-22:16 - Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long Plane Trees. 23:1-23:17 - Robert Cardona, Justin Curry, Tung Lam, Michael Lesnick:
The Universal ℓp-Metric on Merge Trees. 24:1-24:20 - Erin Wolf Chambers, Salman Parsa, Hannah Schreiber:
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. 25:1-25:15 - Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. 26:1-26:16 - Jean Chartier, Arnaud de Mesmay:
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. 27:1-27:16 - Rajesh Chitnis, Nitin Saurabh:
Tight Lower Bounds for Approximate & Exact k-Center in ℝd. 28:1-28:15 - Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo:
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. 29:1-29:17 - Jonathan B. Conroy, Csaba D. Tóth:
Hop-Spanners for Geometric Intersection Graphs. 30:1-30:17 - Marco Contessoto, Facundo Mémoli, Anastasios Stefanou, Ling Zhou:
Persistent Cup-Length. 31:1-31:17 - Gábor Damásdi, Dömötör Pálvölgyi:
Three-Chromatic Geometric Hypergraphs. 32:1-32:13 - James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A Solution to Ringel's Circle Problem. 33:1-33:14 - Tamal K. Dey, Woojin Kim, Facundo Mémoli:
Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications. 34:1-34:17 - Tamal K. Dey, Michal Lipinski, Marian Mrozek, Ryan Slechta:
Tracking Dynamical Features via Continuation and Persistence. 35:1-35:17 - Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. 36:1-36:18 - Nathan M. Dunfield, Malik Obeidin, Cameron Gates Rudd:
Computing a Link Diagram from Its Exterior. 37:1-37:24 - Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. 38:1-38:14 - Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. 39:1-39:15 - Alexandros Eskenazis:
ε-Isometric Dimension Reduction for Incompressible Subsets of ℓp. 40:1-40:14 - Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Short Topological Decompositions of Non-Orientable Surfaces. 41:1-41:16 - Abhibhav Garg, Rafael Oliveira, Akash Sengupta:
Robust Radical Sylvester-Gallai Theorem for Quadratics. 42:1-42:13 - Shir Peleg, Amir Shpilka:
Robust Sylvester-Gallai Type Theorem for Quadratic Polynomials. 43:1-43:15 - Marc Glisse, Siddharth Pritam:
Swap, Shift and Trim to Edge Collapse a Filtration. 44:1-44:15 - Nicolas Grelier:
Hardness and Approximation of Minimum Convex Partition. 45:1-45:15 - Thekla Hamm, Petr Hlinený:
Parameterised Partially-Predrawn Crossing Number. 46:1-46:15 - Sariel Har-Peled, Everett Yang:
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. 47:1-47:13 - Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. 48:1-48:17 - Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. 49:1-49:17 - Chaya Keller, Micha A. Perles:
An (ℵ₀, k+2)-Theorem for k-Transversals. 50:1-50:14 - Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. 51:1-51:15 - Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. 52:1-52:14 - Francis Lazarus, Florent Tallerie:
A Universal Triangulation for Flat Tori. 53:1-53:18 - Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. 54:1-54:15 - Tim Ophelders, Salman Parsa:
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. 55:1-55:16 - János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Short Polygonal Chains. 56:1-56:12 - Zuzana Patáková, Micha Sharir:
Covering Points by Hyperplanes and Related Problems. 57:1-57:7 - Alexander Rolle:
The Degree-Rips Complexes of an Annulus with Outliers. 58:1-58:14 - Daniel Rutschmann, Manuel Wettstein:
Chains, Koch Chains, and Point Sets with Many Triangulations. 59:1-59:18 - Donald R. Sheehy, Siddharth S. Sheth:
Nearly-Doubling Spaces of Persistence Diagrams. 60:1-60:15 - Elchanan Solomon, Alexander Wagner, Paul Bendich:
From Geometry to Topology: Inverse Theorems for Distributed Persistence. 61:1-61:16 - Andrew Suk, Ji Zeng:
A Positive Fraction Erdős-Szekeres Theorem and Its Applications. 62:1-62:15 - Wai Ming Tai:
Optimal Coreset for Gaussian Kernel Density Estimation. 63:1-63:15 - Fan Wang, Hubert Wagner, Chao Chen:
GPU Computation of the Euler Characteristic Curve for Imaging Data. 64:1-64:16 - Julien Bourgeois, Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Benoît Piranda, Christian Rieck, Christian Scheffer:
Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition). 65:1-65:6 - Erin W. Chambers, Christopher Fillmore, Elizabeth Stephenson, Mathijs Wintraecken:
A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition). 66:1-66:9 - Satyan L. Devadoss, Matthew S. Harvey, Sam Zhang:
Visualizing and Unfolding Nets of 4-Polytopes (Media Exposition). 67:1-67:4 - Anirban Ghosh, F. N. U. Shariful, David Wisnosky:
Visualizing WSPDs and Their Applications (Media Exposition). 68:1-68:4 - Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). 69:1-69:6 - Willem Sonke, Jules Wulms:
An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition). 70:1-70:4 - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo:
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). 71:1-71:8 - Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge). 72:1-72:6 - Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège:
Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge). 73:1-73:6 - André Schidler:
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge). 74:1-74: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 2024-10-31 20:21 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:
