Journals in DBLP
Kwong-fai Chan , Tak Wah Lam An on-line algorithm for navigating in unknown environment. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:227-244 [Journal ] Hans-Peter Lenhof , Michiel H. M. Smid An optimal construction method for generalized convex layers. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:245-267 [Journal ] Dorothea Wagner Optimal routing through dense chanels. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:269-289 [Journal ] D. T. Lee , Majid Sarrafzadeh Maximum independent set of a permutation graph in K tracks. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:291-304 [Journal ] H. S. Lee , R. C. Chang Regular enumeration of grid points in a convex polygon. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:305-322 [Journal ] Ta. Asano Dynamic Programming on Intervals. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:323-330 [Journal ] Ravi Janardan On maintaining the width and diameter of a planar point-set online. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:331-344 [Journal ] Joseph O'Rourke Computational geometry column 20. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:347-349 [Journal ]