The SCEAS System
Navigation Menu

Journals in DBLP

Discrete & Computational Geometry
2008, volume: 39, number: 1-3


  1. Foreword. [Citation Graph (, )][DBLP]


  2. There Are Not Too Many Magic Configurations. [Citation Graph (, )][DBLP]


  3. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


  4. Robust Shape Fitting via Peeling and Grating Coresets. [Citation Graph (, )][DBLP]


  5. Siegel's Lemma and Sum-Distinct Sets. [Citation Graph (, )][DBLP]


  6. Slicing Convex Sets and Measures by a Hyperplane. [Citation Graph (, )][DBLP]


  7. A Centrally Symmetric Version of the Cyclic Polytope. [Citation Graph (, )][DBLP]


  8. On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities. [Citation Graph (, )][DBLP]


  9. Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres. [Citation Graph (, )][DBLP]


  10. Isotopic Implicit Surface Meshing. [Citation Graph (, )][DBLP]


  11. Line Transversals to Disjoint Balls. [Citation Graph (, )][DBLP]


  12. Generating All Vertices of a Polyhedron Is Hard. [Citation Graph (, )][DBLP]


  13. Norm Bounds for Ehrhart Polynomial Roots. [Citation Graph (, )][DBLP]


  14. Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. [Citation Graph (, )][DBLP]


  15. Grid Vertex-Unfolding Orthogonal Polyhedra. [Citation Graph (, )][DBLP]


  16. Empty Convex Hexagons in Planar Point Sets. [Citation Graph (, )][DBLP]


  17. Affinely Regular Polygons as Extremals of Area Functionals. [Citation Graph (, )][DBLP]


  18. Improved Output-Sensitive Snap Rounding. [Citation Graph (, )][DBLP]


  19. Pure Point Diffractive Substitution Delone Sets Have the Meyer Property. [Citation Graph (, )][DBLP]


  20. Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. [Citation Graph (, )][DBLP]


  21. Empty Simplices of Polytopes and Graded Betti Numbers. [Citation Graph (, )][DBLP]


  22. Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes. [Citation Graph (, )][DBLP]


  23. Finding the Homology of Submanifolds with High Confidence from Random Samples. [Citation Graph (, )][DBLP]


  24. Odd Crossing Number and Crossing Number Are Not the Same. [Citation Graph (, )][DBLP]


  25. Visibility Graphs of Point Sets in the Plane. [Citation Graph (, )][DBLP]


  26. Decomposability of Polytopes. [Citation Graph (, )][DBLP]


  27. An Inscribing Model for Random Polytopes. [Citation Graph (, )][DBLP]


  28. An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. [Citation Graph (, )][DBLP]


  29. General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties. [Citation Graph (, )][DBLP]

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