
Journals in DBLP
Comput. Geom. 2007, volume: 37, number: 3
 Carmen Cortés, Alberto Márquez
Editorial. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:37, n:3, pp:141 [Journal]
 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:142154 [Journal]
 Oswin Aichholzer, Klaus Reinhardt
A quadratic distance bound on sliding between crossingfree spanning trees. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:37, n:3, pp:155161 [Journal]
 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:162174 [Journal]
 Marc J. van Kreveld, Bettina Speckmann
On rectangular cartograms. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:37, n:3, pp:175187 [Journal]
 Annette EbbersBaumann, 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:188208 [Journal]
 Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
Spaceefficient geometric divideandconquer algorithms. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:37, n:3, pp:209227 [Journal]
