Journals in DBLP

Discrete & Computational Geometry
2002, volume: 28, number: 4

1. Farhad Shahrokhi, László A. Székely
   Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:447-448 [Journal]
   
2. James Abello, Krishna Kumar
   Visibility Graphs and Oriented Matroids. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:449-465 [Journal]
   
3. Bernardo M. Ábrego, Silvia Fernández-Merchant
   The Unit Distance Problem for Centrally Symmetric Convex Polygons. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:467-473 [Journal]
   
4. Boris Aronov, Micha Sharir
   Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:475-490 [Journal]
   
5. Aart Blokhuis, Ákos Seress
   The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:491-494 [Journal]
   
6. Peter Braß
   Combinatorial Geometry Problems in Pattern Recognition. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:495-510 [Journal]
   
7. Herbert Edelsbrunner, David Letscher, Afra Zomorodian
   Topological Persistence and Simplification. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:511-533 [Journal]
   
8. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali
   New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:535-569 [Journal]
   
9. Dan Ismailescu
   Restricted Point Configurations with Many Collinear {k}-Tuplets. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:571-575 [Journal]
   
10. Gyula Károlyi, József Solymosi
    Almost Disjoint Triangles in 3-Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:577-583 [Journal]
    
11. János Pach, Gábor Tardos
    Untangling a Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:585-592 [Journal]
    
12. János Pach, Géza Tóth
    Recognizing String Graphs Is Decidable. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:593-606 [Journal]
    
13. Rom Pinchasi
    Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:607-624 [Journal]
    
14. Attila Pór, Pavel Valtr
    The Partitioned Version of the Erdös - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:625-637 [Journal]
    
15. József Solymosi, Gábor Tardos, Csaba D. Tóth
    The k Most Frequent Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:639-648 [Journal]
    
16. Konrad J. Swanepoel
    Independence Numbers of Planar Contact Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:649-670 [Journal]
    
17. Pavel Valtr
    A Sufficient Condition for the Existence of Large Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:671-682 [Journal]