Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 11
Volume 11, Number 1, 2020
- Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma:
On optimal polyline simplification using the Hausdorff and Fréchet distance. 1-25 - Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. 26-59 - Adrian Dumitrescu, Ritankar Mandal:
New lower bounds for the number of pseudoline arrangements. 60-92 - Hugo Alves Akitaya
, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi:
Rigid foldability is NP-hard. 93-124 - Robert Cyrus Haraway III:
Determining hyperbolicity of compact orientable 3-manifolds with torus boundary. 125-136 - Manuel Borrazzo, Fabrizio Frati:
On the planar edge-length ratio of planar graphs. 137-155 - Omrit Filtser, Matthew J. Katz:
Algorithms for the discrete Fréchet distance under translation. 156-175 - Braxton Osting, Sourabh Palande, Bei Wang:
Spectral sparsification of simplicial complexes for clustering and label propagation. 176-211 - Prosenjit Bose, Jean-Lou De Carufel, Olivier Devillers:
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs. 212-234 - Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. 235-282 - Dingkang Wang, Yusu Wang:
An Improved Cost Function for Hierarchical Cluster Trees. 283-331 - Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. 332-353 - Balázs Keszegh, Dömötör Pálvölgyi:
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. 354-370 - Cédric Pilatte:
NP-completeness of slope-constrained drawing of complete graphs. 371-396 - Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. 397-417 - Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster algorithms for some optimization problems on collinear points. 418-432 - Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing graphs on few lines and few planes. 433-475 - Stefan Felsner:
4-Connected triangulations on few lines. 476-492 - Raphael Steiner, Manfred Scheucher, Stefan Felsner, Pavel Valtr, Man-Kwun Chiu, Patrick Schnider:
On the Average Complexity of the k-Level. 493-506 - Michiel Smid, Anil Maheshwari, Wolfgang Mulzer:
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. 507-524 - Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-space trade-offs for computing Euclidean minimum spanning trees. 525-547 - Georg Grasegger, Jan Legerský, Josef Schicho:
On the classification of motions of paradoxically movable graphs. 548-575 - Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving balls by a hyperplane in deterministic linear time. 576-614 - Tanessi Quintanar:
An explicit PL-embedding of the square flat torus into $\mathbb{E}^3$. 615-628 - David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos:
Approximate greedy clustering and distance selection for graph metrics. 629-652 - Mark de Berg, Christian Knauer:
Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. 653-655
Volume 11, Number 2, 2020
Articles
- Michael Kerber, Michael Lesnick, Steve Oudot:
Exact computation of the matching distance on 2-parameter persistence modules. 4-25 - Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. 26-61 - Vladimir Braverman, Moses Charikar, William Kuszmaul, Lin F. Yang:
The one-way communication complexity of dynamic time warping distance. 62-93 - Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline simplification has cubic complexity. 94-130 - Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. 131-161 - Herbert Edelsbrunner, Ziga Virk, Hubert Wagner:
Topological data analysis in information space. 162-182 - Nathaniel Lahn, Sharath Raghvendra:
A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings. 183-204 - Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. 205-233 - Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov:
Preconditioning for the Geometric Transportation Problem. 234-259
a service of 
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-06-10 21:31 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
