Journals in DBLP

Discrete & Computational Geometry
2000, volume: 24, number: 1

1. Leonidas J. Guibas, John Hershberger, Subhash Suri
   Morphing Simple Polygons. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:1-34 [Journal]
   
2. Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert
   Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:35-48 [Journal]
   
3. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
   Affine Maps That Induce Polyhedral Complex Isomorphisms. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:49-60 [Journal]
   
4. Jirí Matousek
   On Approximate Geometric k-Clustering. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:61-84 [Journal]
   
5. J. Vinson
   On Holyhedra. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:85-104 [Journal]
   
6. Anupam Gupta
   Embedding Tree Metrics into Low-Dimensional Euclidean Spaces. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:105-116 [Journal]
   
7. Yoshiyasu Ishigami
   How Many Diagonal Rectangles Are Needed to Cover an Orthogonal Polygon? [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:117-140 [Journal]
   
8. S. Stein
   A Generalized Conjecture about Cutting a Polygon into Triangles of Equal Areas. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2000, v:24, n:1, pp:141-145 [Journal]