Journals in DBLP

Discrete & Computational Geometry
2009, volume: 41, number: 2

1. 
   On Kalai's Conjectures Concerning Centrally Symmetric Polytopes. [Citation Graph (, )][DBLP]
   
   
2. 
   Linear Programming Bounds for Codes via a Covering Argument. [Citation Graph (, )][DBLP]
   
   
3. 
   Simple Polygons of Maximum Perimeter Contained in a Unit Disk. [Citation Graph (, )][DBLP]
   
   
4. 
   On Regular Vertices of the Union of Planar Convex Objects. [Citation Graph (, )][DBLP]
   
   
5. 
   Generalizations of Schöbi's Tetrahedral Dissection. [Citation Graph (, )][DBLP]
   
   
6. 
   Finding a Simple Polytope from Its Graph in Polynomial Time. [Citation Graph (, )][DBLP]
   
   
7. 
   Stability Properties of Neighbourly Random Polytopes. [Citation Graph (, )][DBLP]
   
   
8. 
   Lower Bounds for Local Versions of Dimension Reductions. [Citation Graph (, )][DBLP]
   
   
9. 
   Multitriangulations as Complexes of Star Polygons. [Citation Graph (, )][DBLP]
   
   
10. 
    A Continuous d -Step Conjecture for Polytopes. [Citation Graph (, )][DBLP]
    
    
11. 
    On Minimal Triangulations of Products of Convex Polygons. [Citation Graph (, )][DBLP]
    
    
12. 
    Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]