Journals in DBLP

Comput. Geom.
2006, volume: 35, number: 3

1. Konstantinos G. Kakoulis, Ioannis G. Tollis
   Algorithms for the multiple label placement problem. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:35, n:3, pp:143-161 [Journal]
   
2. Alon Efrat, Stephen G. Kobourov, Anna Lubiw
   Computing homotopic shortest paths efficiently. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:35, n:3, pp:162-172 [Journal]
   
3. J. Mark Keil, Tzvetalin S. Vassilev
   Algorithms for optimal area triangulations of a convex polygon. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:35, n:3, pp:173-187 [Journal]
   
4. Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe
   The minimum Manhattan network problem: Approximations and exact solutions. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:35, n:3, pp:188-208 [Journal]
   
5. Timothy M. Chan
   Three problems about simple polygons. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:35, n:3, pp:209-217 [Journal]
   
6. Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
   The minimum-area spanning tree problem. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:35, n:3, pp:218-225 [Journal]