Journals in DBLP

Discrete & Computational Geometry
1997, volume: 18, number: 4

1. László Lovász, János Pach, Mario Szegedy
   On Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:369-376 [Journal]
   
2. Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell
   An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:377-383 [Journal]
   
3. Victor Klee, T. Lewis, Balder Von Hohenbalken
   Appollonius Revisited: Supporting Spheres for Sundered Systems. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:385-395 [Journal]
   
4. Michael T. Goodrich, Edgar A. Ramos
   Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:397-420 [Journal]
   
5. Dmitry N. Kozlov
   Convex Hulls of f- and $\beta$-Vectors. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:421-431 [Journal]
   
6. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
   Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:433-454 [Journal]
   
7. Ulrich Kortenkamp
   Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:455-462 [Journal]
   
8. Tor Gulliksen, Arne Hole
   On the Number of Linearly Separable Subsets of Finite Sets in Rn. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1997, v:18, n:4, pp:463-472 [Journal]