default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 12
Volume 12, Number 1, 2021
- Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic:
Local routing in WSPD-based spanners. 1-34 - Ahmad Biniaz:
A short proof of the toughness of Delaunay triangulations. 35-39 - Saladi Rahul:
Approximate range counting revisited. 40-69 - Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the dog fast in practice: Algorithm engineering of the Fréchet distance. 70-108 - A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar bichromatic bottleneck spanning trees. 109-127 - Stav Ashur, Omrit Filtser, Matthew J. Katz:
A constant-factor approximation algorithm for vertex guarding a WV-polygon. 128-144 - Sergey Avvakumov, Gabriel Nivasch:
Homotopic curve shortening and the affine curve-shortening flow. 145-177 - David Eppstein:
Cubic planar graphs that cannot be drawn on few lines. 178-197
Volume 12, Number 2, 2021
Articles
- Alan Arroyo, Julien Bensmail, R. Bruce Richter:
Extending Drawings of Graphs to Arrangements of Pseudolines. 3-24 - Sándor Kisfaludi-Bak:
A quasi-polynomial algorithm for well-spaced hyperbolic TSP. 25-54 - Jeff Erickson, Patrick Lin:
A Toroidal Maxwell-Cremona-Delaunay Correspondence. 55-85 - Ljubomir Perkovic, Michael Dennis, Duru Türkoglu:
The Stretch Factor of Hexagon-Delaunay Triangulations. 86-125 - Meirav Zehavi, Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. 126-148 - Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-Case Optimal Squares Packing into Disks. 149-175
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-12-19 22: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:
