Journals in DBLP

Comput. Geom.
2004, volume: 29, number: 2

1. Luc Devroye, Christophe Lemaire, Jean-Michel Moreau
   Expected time analysis for Delaunay point location. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:2, pp:61-89 [Journal]
   
2. Paolo Penna, Paola Vocca
   Proximity drawings in polynomial area and volume. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:2, pp:91-116 [Journal]
   
3. 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:117-133 [Journal]
   
4. 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:135-145 [Journal]
   
5. Lars Arge, Jan Vahrenhold
   I/O-efficient dynamic planar point location. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:2, pp:147-162 [Journal]