
Journals in DBLP
Comput. Geom. 2004, volume: 29, number: 2
 Luc Devroye, Christophe Lemaire, JeanMichel Moreau
Expected time analysis for Delaunay point location. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:2, pp:6189 [Journal]
 Paolo Penna, Paola Vocca
Proximity drawings in polynomial area and volume. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:2, pp:91116 [Journal]
 Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner
How to draw the minimum cuts of a planar graph. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:2, pp:117133 [Journal]
 Oswin Aichholzer, Ferran Hurtado, Marc Noy
A lower bound on the number of triangulations of planar point sets. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:2, pp:135145 [Journal]
 Lars Arge, Jan Vahrenhold
I/Oefficient dynamic planar point location. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:2, pp:147162 [Journal]
