The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Discrete & Computational Geometry
1991, volume: 6, number:

  1. Marek Lassak, Jixian Zhang
    An On-line Potato-Sack Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:1-7 [Journal]
  2. Wei-pang Chin, Simeon C. Ntafos
    Shortest Watchman Routes in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:9-31 [Journal]
  3. Margaret M. Bayer, Andrew Klapper
    A New Index for Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:33-47 [Journal]
  4. Michael E. Houle
    Theorems on the Existence of Separating Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:49-56 [Journal]
  5. Hiroshi Maehara
    Dispersed Points and Geometric Embedding of Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:57-67 [Journal]
  6. R. S. Booth
    Analytic Formulas for Full Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:69-82 [Journal]
  7. Horst Martini
    Convex Polytopes Whose Projection Bodies and Difference Set Are Polars. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:83-91 [Journal]
  8. Zoltán Füredi
    The Densest Packing of Equal Circles into a Parallel Strip. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:95-106 [Journal]
  9. Louis J. Billera, Lauren L. Rose
    A Dimension Series for Multivariate Splines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:107-128 [Journal]
  10. Jirí Matousek
    Lower Bounds on the Length of Monotone Paths in Arrangement. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:129-134 [Journal]
  11. Colin Adams, William Sherman
    Minimum Ideal Triangulations of Hyperbolic 3-Manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:135-153 [Journal]
  12. Ralph Kopperman, Paul R. Meyer, Richard G. Wilson
    A Jordan Surface Theorem for Three-Dimensional Digital Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:155-161 [Journal]
  13. Gilbert Stengel
    Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:163-169 [Journal]
  14. Tudor Zamfirescu
    On Two Conjectures of Franz Hering about Convex Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:171-180 [Journal]
  15. Peter Schmitt
    Disks with Special Properties of Densest Packings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:181-190 [Journal]
  16. Riccardo Benedetti, Francois Loeser, Jean-Jacques Risler
    Bounding the Number of Connected Components of a Real Algebraic Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:191-209 [Journal]
  17. Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
    On the Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:211-224 [Journal]
  18. Jean E. Taylor
    On the Global Structure of Crystalline Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:225-262 [Journal]
  19. Lee R. Nackman, Vijay Srinivasan
    Bisectors of Linearly Separable Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:263-275 [Journal]
  20. Mark D. Haiman
    A Simple and Relatively Efficient Triangulation of the n-Cube. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:287-289 [Journal]
  21. Fernando Affentranger, John A. Wieacker
    On the Convex Hull of Uniform Randowm Points in a Simple d-polytope. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:291-305 [Journal]
  22. Ketan Mulmuley
    On Levels in Arrangement and Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:307-338 [Journal]
  23. Hiroshi Maehara
    On Graver's Conjecture Concerning the Rigidity Problem of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:339-342 [Journal]
  24. Rex A. Dwyer
    Higher-Dimensional Voronoi Diagrams in Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:343-367 [Journal]
  25. Pravin M. Vaidya
    A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:369-381 [Journal]
  26. Jirí Matousek
    Cutting Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:385-406 [Journal]
  27. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:407-422 [Journal]
  28. Raimund Seidel
    Small-Dimensional Linear Programming and Convex Hulls Made Easy. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:423-434 [Journal]
  29. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:435-442 [Journal]
  30. Daniel Bienstock
    Some Provably Hard Crossing Number Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:443-459 [Journal]
  31. John F. Canny, Ashutosh Rege, John H. Reif
    An Exact Algorithm for Kinodynamic Planning in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:461-484 [Journal]
  32. Bernard Chazelle
    Triangulating a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:485-524 [Journal]
  33. Alexander Schrijver
    Disjoint Homotopic Paths and Trees in a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:527-574 [Journal]
  34. Danièle Beauquier, Maurice Nivat
    On Translating One Polyomino to Tile the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:575-592 [Journal]
  35. Micha Sharir
    On k-Sets in Arrangement of Curves and Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:593-613 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002