Journals in DBLP

Comput. Geom.
2008, volume: 40, number: 3

1. 
   Constructing minimum-interference networks. [Citation Graph (, )][DBLP]
   
   
2. 
   Covering point sets with two disjoint disks or squares. [Citation Graph (, )][DBLP]
   
   
3. 
   Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]
   
   
4. 
   Augmenting the connectivity of geometric graphs. [Citation Graph (, )][DBLP]
   
   
5. 
   Iterated snap rounding with bounded drift. [Citation Graph (, )][DBLP]
   
   
6. 
   I/O-efficient algorithms for computing planar geometric spanners. [Citation Graph (, )][DBLP]