![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Computational Geometry, Volume 3
Volume 3, Number 1, 2012
- Dengpan Zhou, Jie Gao:
The emergence of sparse spanners and well-separated pair decomposition under anarchy. 1-19 - Boris Bukh, Gabriel Nivasch
:
Upper bounds for centerlines. 20-30 - Martin Fürer, Shiva Prasad Kasiviswanathan:
Spanners for geometric intersection graphs with applications. 31-64 - Sariel Har-Peled
, Mira Lee:
Weighted geometric set cover problems revisited. 65-85 - Ruy Fabila Monroy, David R. Wood
:
Colouring the triangles determined by a point set. 86-101 - Nieves Atienza, Natalia de Castro
, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs. 102-131 - Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the average stretch factor of geometric graphs. 132-153 - Bette Bultena, Matthew Klimesh, Frank Ruskey:
Minimum Area Polyomino Venn Diagrams. 154-167 - Bernd Gärtner, Martin Jaggi, Clément Maria:
An Exponential Lower Bound on the Complexity of Regularization Paths. 168-195 - Paz Carmi, Michiel H. M. Smid:
An optimal algorithm for computing angle-constrained spanners. 196-221 - Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model. 222-249
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.