default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 10
Volume 10, Number 1, 2019
- Balázs Keszegh, Dömötör Pálvölgyi:
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. 1-26 - Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Geometric Intersection Graphs. 27-41 - Jisu Kim, Alessandro Rinaldo, Larry A. Wasserman:
Minimax rates for estimating the dimension of a manifold. 42-95 - Erin Wolf Chambers, Yusu Wang:
Measuring similarity between curves on 2-manifolds via homotopy area. 96-126 - Kolja Knauer, Daniel Gonçalves
, Benjamin Lévêque:
On the structure of Schnyder woods on orientable surfaces. 127-163 - Saul Schleimer, Arnaud de Mesmay, Jessica S. Purcell, Eric Sedgwick:
On the tree-width of knot diagrams. 164-180 - Edouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the parameterized complexity of red-blue points separation. 181-206 - Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. 207-222 - Ramsay Dyer, Gert Vegter, Mathijs Hubertus Maria Johannes Wintraecken:
Simplices modelled on spaces of constant curvature. 223-256 - David Eppstein:
Realization and connectivity of the graphs of origami flat foldings. 257-280 - Shimin Li, Haitao Wang:
Separating overlapped intervals on a line. 281-321 - Yunfeng Hu, Matthew Hudelson, Bala Krishnamoorthy, Altansuren Tumurbaatar, Kevin R. Vixie:
Median shapes. 322-388 - Christian Scheffer, Jan Vahrenhold:
Approximate shortest distances among smooth obstacles in 3D. 389-422 - Maarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Computing representative networks for braided rivers. 423-443 - Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi drawings of knots and links. 444-476 - Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier:
The relationship between the intrinsic Čech and persistence distortion distances for metric graphs. 477-499 - Ananth Kalyanaraman, Methun Kamruzzaman, Bala Krishnamoorthy:
Interesting paths in the mapper complex. 500-531 - Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, Günter Rote:
The geometric dilation of three points. 532-549
Volume 10, Number 2, 2019
Articles
- Timothy M. Chan, Dimitrios Skrepetos:
Approximate shortest paths and distance oracles in weighted unit-disk graphs. 3-20 - Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. 21-44 - Fabian Klute, Martin Nöllenburg:
Minimizing crossings in constrained two-sided circular graph layouts. 45-69 - Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the treewidth of triangulated 3-manifolds. 70-98 - Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic encodings for point configurations. 99-126 - Vincent Divol, Frédéric Chazal:
The density of expected persistence diagrams and its kernel based estimation. 127-153
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-10-16 01:53 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.
