Search the dblp DataBase

Publications of Author

1. Joachim Giesen, Uli Wagner
   Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2003, pp:329-337 [Conf]
   
2. Uli Wagner, Emo Welzl
   Origin-embracing distributions or a continuous analogue of the upper bound theorem. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2000, pp:50-56 [Conf]
   
3. Uli Wagner
   On a Geometric Generalization of the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:635-645 [Conf]
   
4. Christoph Ambühl, Uli Wagner
   On the Clique Problem in Intersection Graphs of Ellipses. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2002, pp:489-500 [Conf]
   
5. Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
   Online conflict-free coloring for intervals. [Citation Graph (0, 0)][DBLP]
   SODA, 2005, pp:545-554 [Conf]
   
6. Uli Wagner
   On the rectilinear crossing number of complete graphs. [Citation Graph (0, 0)][DBLP]
   SODA, 2003, pp:583-588 [Conf]
   
7. Joachim Giesen, Uli Wagner
   Shape Dimension and Intrinsic Metric from Samples of Manifolds. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2004, v:32, n:2, pp:245-267 [Journal]
   
8. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
   k-Sets in Four Dimensions. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2006, v:35, n:2, pp:177-191 [Journal]
   
9. Jirí Matousek, Uli Wagner
   New Constructions of Weak epsilon-Nets. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2004, v:32, n:2, pp:195-206 [Journal]
   
10. Uli Wagner, Emo Welzl
    A Continuous Analogue of the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:205-219 [Journal]
    
11. Christoph Ambühl, Uli Wagner
    The Clique Problem in Intersection Graphs of Ellipses and Triangles. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:3, pp:279-292 [Journal]
    
12. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
    Online Conflict-Free Coloring for Intervals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
    
13. 
    k-sets and continuous motion in R³. [Citation Graph (, )][DBLP]
    
    
14. 
    On Center Regions and Balls Containing Many Points. [Citation Graph (, )][DBLP]
    
    
15. 
    Hardness of embedding simplicial complexes in R^d. [Citation Graph (, )][DBLP]
    
    
16. 
    Transforming spanning trees: A lower bound. [Citation Graph (, )][DBLP]
    
    
17. 
    Hardness of embedding simplicial complexes in R^d [Citation Graph (, )][DBLP]