The SCEAS System
Navigation Menu

Journals in DBLP

Discrete & Computational Geometry
1988, volume: 3, number:

  1. Gil Kalai
    Many Triangulated Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:1-14 [Journal]
  2. Ady Wiernik, Micha Sharir
    Planar Realizations of Nonlinear Davenport-Schnitzel Sequences by Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:15-47 [Journal]
  3. Günter Ewald
    On the Classification of Toric Fano Varieties. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:49-54 [Journal]
  4. Marjorie Senechal
    Tiling the Torus and Other Space Forms. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:55-72 [Journal]
  5. George B. Purdy
    Repeated Angles in E4. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:73-75 [Journal]
  6. Linda L. Deneen, Gary M. Shute
    Polygonizations of Point Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:77-87 [Journal]
  7. Peter Frankl, Hiroshi Maehara
    On the Contact Dimensions of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:89-96 [Journal]
  8. Jean-Pierre Roudneff
    Arrangements of Lines with a Minimum Number of Triangles are Simple. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:97-102 [Journal]
  9. Ingo Althöfer
    On Optimal Realizations of Finite Metric Spaces by Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:103-122 [Journal]
  10. P. Pollack, Micha Sharir, Shmuel Sifrony
    Separating Two Simple Polygons by a Sequence of Translations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:123-136 [Journal]
  11. Bojan Mohar
    Nonorientable Genus of Nearly Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:137-146 [Journal]
  12. Brenda S. Baker, Eric Grosse, Conor S. Rafferty
    Nonobtuse Triangulation of Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:147-168 [Journal]
  13. Wolfgang Kühnel, Gunter Lassmann
    Combinatorial d-Tori with a Large Symmetry Group. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:169-176 [Journal]
  14. Chandrajit L. Bajaj
    The Algebraic Degree of Geometric Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:177-191 [Journal]
  15. Yan Ke, Joseph O'Rourke
    Lower Bounds on Moving a Ladder in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:197-217 [Journal]
  16. John F. Canny, Bruce Randall Donald
    Simplified Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:219-236 [Journal]
  17. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:237-256 [Journal]
  18. David Avis, Rephael Wenger
    Polyhedral Line transversals in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:257-265 [Journal]
  19. David G. Kirkpatrick
    Establishing Order in Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:267-280 [Journal]
  20. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
    Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  21. James A. Wiseman, Paul R. Wilson
    A Sylvester Theorem for Conic Sections. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:295-305 [Journal]
  22. Jim Lawrence
    Valuations and Polarity. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:307-324 [Journal]
  23. Nimrod Megiddo
    On the Complexity of Polyhedral Separability. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:325-337 [Journal]
  24. Bojan Mohar
    Branced Covering. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:339-348 [Journal]
  25. Derick Wood, Chee-Keng Yap
    The Orthogonal Convex Skull Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:349-365 [Journal]
  26. Frank K. Hwang, G. D. Song, G. Y. Ting, Ding-Zhu Du
    A Decomposition Theorem on Euclidean Steiner Minimal Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:367-382 [Journal]
  27. Carsten Müller
    Equidecomposabilitz of Polyhedra with Reference to Crystallographic Groups. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:383-389 [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