Journals in DBLP

Int. J. Comput. Geometry Appl.
1995, volume: 5, number: 3

1. Mark de Berg, Hazel Everett, Hubert Wagener
   Translation queries for sets of polygons. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:221-242 [Journal]
   
2. David Rappaport
   Minimum polygon transversals of line segments. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:243-256 [Journal]
   
3. Mikhail J. Atallah, Danny Z. Chen
   Computing the all-pairs longest chains in the plane. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:257-271 [Journal]
   
4. Hans-Peter Lenhof, Michiel H. M. Smid
   Sequential and parallel algorithms for the k closest pairs problem. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:273-288 [Journal]
   
5. Yaw-Ling Lin, Steven Skiena
   Complexity aspects of visibility graphs. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:289-312 [Journal]
   
6. Chandrajit L. Bajaj, Andrew V. Royappa
   Finite representations of real parametric curves and surfaces. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:313-326 [Journal]
   
7. Hristo Djidjev, Andrzej Lingas
   On computing Voronoi diagrams for sorted point sets. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:327-337 [Journal]
   
8. Joseph O'Rourke
   Computational geometry column 26. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:339-341 [Journal]