Journals in DBLP

Int. J. Comput. Geometry Appl.
2004, volume: 14, number: 1-2

1. D. T. Lee, Joseph S. B. Mitchell
   A note from the editors-in-chief. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:- [Journal]
   
2. Binhai Zhu
   Guest editor's foreword. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:1-2 [Journal]
   
3. Sergey Bereg
   Cylindrical hierarchy for deforming necklaces. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:3-17 [Journal]
   
4. Jinhui Xu, Zhiyong Lin, Yang Yang, Ronald Berezney
   Traveling salesman problem of segments. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:19-40 [Journal]
   
5. Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell
   Tetris is hard, even to approximate. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:41-68 [Journal]
   
6. Xiang-Yang Li, Yu Wang
   Efficient construction of low weighted bounded degree planar spanner. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:69-84 [Journal]
   
7. Xiaodong Wu, Danny Z. Chen, James J. Mason, Steven R. Schmid
   Efficient approximation algorithms for pairwise data clustering and applications. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:85-104 [Journal]
   
8. Michael J. Collins
   Covering a set of points with a minimum number of turns. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:105-114 [Journal]