Journals in DBLP

Discrete & Computational Geometry
2010, volume: 43, number: 3

1. 
   Convex Polygons are Cover-Decomposable. [Citation Graph (, )][DBLP]
   
   
2. 
   Streaming Algorithms for Line Simplification. [Citation Graph (, )][DBLP]
   
   
3. 
   Simplices and Spectra of Graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. [Citation Graph (, )][DBLP]
   
   
5. 
   The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, But Not Quite. [Citation Graph (, )][DBLP]
   
   
6. 
   Iterated Point-Line Configurations Grow Doubly-Exponentially. [Citation Graph (, )][DBLP]
   
   
7. 
   Bichromatic and Equichromatic Lines in C² and R². [Citation Graph (, )][DBLP]
   
   
8. 
   On the Characterization of Expansion Maps for Self-Affine Tilings. [Citation Graph (, )][DBLP]
   
   
9. 
   Characterizing Graphs with Convex and Connected Cayley Configuration Spaces. [Citation Graph (, )][DBLP]
   
   
10. 
    Planar Graphs Have 1-string Representations. [Citation Graph (, )][DBLP]
    
    
11. 
    Carathéodory, Helly and the Others in the Max-Plus World. [Citation Graph (, )][DBLP]
    
    
12. 
    Multiplicity mod 2 as a Metric Invariant. [Citation Graph (, )][DBLP]
    
    
13. 
    Segment Orders. [Citation Graph (, )][DBLP]
    
    
14. 
    The Charney-Davis Conjecture for Certain Subdivisions of Spheres. [Citation Graph (, )][DBLP]