The SCEAS System
Navigation Menu

Journals in DBLP

Discrete & Computational Geometry
1992, volume: 8, number:

  1. Robert Ammann, Branko Grünbaum, G. C. Shephard
    Aperiodic Tiles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:1-25 [Journal]
  2. Vladimir G. Boltyanski
    A New Step in the Solution of the Szökefalvi-Nagy Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:27-49 [Journal]
  3. Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec
    Applications of Random Sampling to On-line Algorithms in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:51-71 [Journal]
  4. Timothy Law Snyder
    Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:73-92 [Journal]
  5. Amos Altshuler, Ulrich Brehm
    Neighborly Maps with Few Vertices. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:93-104 [Journal]
  6. John H. Conway, Neil J. A. Sloane
    On the Covering Multiplicity of Lattices. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:109-130 [Journal]
  7. Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:131-152 [Journal]
  8. Ulrich Brehm
    Nonuniqueness Results for X-Ray Problems with Point Sources. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:153-169 [Journal]
  9. P. G. Doyle, J. C. Lagarias, Dana Randall
    Self-Packing of Centrally Symmetric Convex Bodies in R2. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:171-189 [Journal]
  10. Marco Pellegrini, Peter W. Shor
    Finding Stabbing Lines in 3-Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:191-208 [Journal]
  11. Paul H. Edelman
    On the Average Number of k-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:209-213 [Journal]
  12. Boris Aronov, Joseph O'Rourke
    Nonoverlap of the Star Unfolding. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:219-250 [Journal]
  13. Claire Kenyon, Richard Kenyon
    How to Take Short Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:251-264 [Journal]
  14. Clyde L. Monma, Subhash Suri
    Transitions in Geometric Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:265-293 [Journal]
  15. David Avis, Komei Fukuda
    A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:295-313 [Journal]
  16. Jirí Matousek
    Efficient Partition Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:315-334 [Journal]
  17. Ketan Mulmuley, Sandeep Sen
    Dynamic Point Location in Arrangement of Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:335-360 [Journal]
  18. Gil Kalai
    Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:363-372 [Journal]
  19. Seth M. Malitz, Jerome I. Malitz
    A Bounded Compactness Theorem for L1 - Embed ability of Metric Spaces in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:373-385 [Journal]
  20. Robert M. Erdahl
    A Cone of Inhomogeneous Second-Order Polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:387-416 [Journal]
  21. R. J. Gardner, Michael Kallay
    Subdivision Algorithms and the Kernel of a Polyhedron. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:417-427 [Journal]
  22. Brett T. Garrett
    Circle Packing and Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:429-440 [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