Journals in DBLP

Int. J. Comput. Geometry Appl.
1996, volume: 6, number: 3

1. Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
   An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:247-261 [Journal]
   
2. Rolf Klein, Andrzej Lingas
   A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:263-278 [Journal]
   
3. Michel Pocchiola, Gert Vegter
   The visibility complex. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:279-308 [Journal]
   
4. Joseph S. B. Mitchell
   Shortest paths among obstacles in the plane. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:309-332 [Journal]
   
5. Ashim Garg, Michael T. Goodrich, Roberto Tamassia
   Planar upward tree drawings with optimal area. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:333-356 [Journal]
   
6. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
   Approximating center points with iterative Radon points. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:357-377 [Journal]
   
7. Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin
   Scalable parallel computational geometry for coarse grained multicomputers. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:379-400 [Journal]