The SCEAS System
Navigation Menu

Journals in DBLP

Discrete & Computational Geometry
2001, volume: 26, number: 2

  1. Pankaj K. Agarwal
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:185-186 [Journal]
  2. G. Tóth
    Point Sets with Many k-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:187-194 [Journal]
  3. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An Improved Bound for k-Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:195-204 [Journal]
  4. Uli Wagner, Emo Welzl
    A Continuous Analogue of the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:205-219 [Journal]
  5. Bernard Chazelle, Alexey Lvov
    A Trace Bound for the Hereditary Discrepancy. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:221-231 [Journal]
  6. Edgar A. Ramos
    An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:233-244 [Journal]
  7. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
    A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:245-265 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002