Journals in DBLP

Comput. Geom.
2007, volume: 37, number: 3

1. Carmen Cortés, Alberto Márquez
   Editorial. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:141- [Journal]
   
2. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
   Approximate distance oracles for graphs with dense clusters. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:142-154 [Journal]
   
3. Oswin Aichholzer, Klaus Reinhardt
   A quadratic distance bound on sliding between crossing-free spanning trees. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:155-161 [Journal]
   
4. Günter Rote
   Computing the Fréchet distance between piecewise smooth curves. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:162-174 [Journal]
   
5. Marc J. van Kreveld, Bettina Speckmann
   On rectangular cartograms. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:175-187 [Journal]
   
6. Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
   Geometric dilation of closed planar curves: New lower bounds. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:188-208 [Journal]
   
7. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
   Space-efficient geometric divide-and-conquer algorithms. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:209-227 [Journal]