Journals in DBLP

Discrete & Computational Geometry
1993, volume: 10, number:

1. Alexander I. Barvinok
   Feasibility Testing for Systems of Real Quadratic Equations. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:1-13 [Journal]
   
2. Ulrich Betke, Martin Henk
   Approximating the Volume of Convex Bodies. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:15-21 [Journal]
   
3. Bernd Sturmfels, Günter M. Ziegler
   Extension Spaces of Oriented Matroids. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:23-45 [Journal]
   
4. Gerhard Reinelt
   A Note on Small Linear-Ordering Polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:67-78 [Journal]
   
5. Beifang Chen
   On the Euler Characteristic of Finite Unions of Convex Sets. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:79-93 [Journal]
   
6. Nickolay M. Korneenko, Nickolay N. Metelskij
   On Lattice Points in Polyhedral Cross-Sections. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:95-99 [Journal]
   
7. James H. Schmerl
   Partitioning Euclidean Space. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:101-106 [Journal]
   
8. Noga Alon, Yossi Azar
   On-Line Steine Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:113-121 [Journal]
   
9. Alexander I. Barvinok
   Computing the Volume, Counting Integral Points, and Exponential Sums. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1993, v:10, n:, pp:123-141 [Journal]
   
10. Hervé Brönnimann, Bernard Chazelle, János Pach
    How Hard Is Half-Space Range Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:143-155 [Journal]
    
11. Jirí Matousek
    Range Searching with Efficient Hiearchical Cutting. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:157-182 [Journal]
    
12. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Diameter, Width, Closest Line Pair, and Parametric Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:183-196 [Journal]
    
13. Herbert Edelsbrunner, Tiow Seng Tan
    An Upper Bound for Conforming Delaunary Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:193-213 [Journal]
    
14. Jirí Matousek, Otfried Schwarzkopf
    On Ray Shooting in Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:215-232 [Journal]
    
15. Thomas H. Brylawski, Günter M. Ziegler
    Topological Representation of Dual Pairs of Oriented Matroids. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:237-240 [Journal]
    
16. Nicolai E. Mnëv, Günter M. Ziegler
    Combinatorial Models for the Finite-Dimensional Grassmannians. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:241-250 [Journal]
    
17. Jürgen Richter-Gebert
    Oriented Matroids with Few Mutations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:251-269 [Journal]
    
18. Nicolai E. Mnëv, Jürgen Richter-Gebert
    Two Constructions of Oriented Matroids with Disconnected Extension Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:271-285 [Journal]
    
19. Jürgen Richter-Gebert
    Combinatorial Obstructions to the Lifting of Weaving Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:287-312 [Journal]
    
20. Günter M. Ziegler
    "What Is a Complex Matroid?". [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:313-348 [Journal]
    
21. Douglas J. Muder
    A New Bound on the Local Density of Sphere Packings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:351-375 [Journal]
    
22. Bernard Chazelle
    An Optimal Convex Hull Algorithm in Any Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:377-409 [Journal]
    
23. Keith Ball
    The Reserse Isoperimetric Problem for Gaussian Measure. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:411-420 [Journal]
    
24. Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir
    An Invariant Property of Balls in Arrangements of Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:421-425 [Journal]
    
25. Kenneth L. Clarkson
    A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:427-433 [Journal]
    
26. J. Linhart
    Arrangement of Oriented Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:435-446 [Journal]
    
27. Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, Tony C. Woo
    On the Number of Guard Edges of a Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:447-462 [Journal]