Your search returned the following 18 documents:

18. On Enumerating Minimal Transversals of Geometric Hypergraphs
    Khaled Elbassioni, Imran Rauf, and Saurabh Ray
    
    
17. Counting Triangulations Approximately
    Victor Alvarez, Karl Bringmann, Saurabh Ray, and Raimund Seidel
    In: 25th Canadian Conference on Computational Geometry (CCCG-13), Waterloo, Ontario, Canada, 2013, 85-89
    
16. Conflict-free coloring for rectangle ranges using O(n .382) colors
    Deepak Ajwani, Khaled Elbassioni, Sathish Govindarajan, and Saurabh Ray
    Discrete & Computational Geometry 48 (1): 39-52, 2012
    
15. Counting Crossing Free Structures
    Victor Alvarez, Karl Bringmann, Radu Curticapean, and Saurabh Ray
    In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), Chapel Hill, NC, USA, 2012, 61-68
    
    
14. On the complexity of the highway problem
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and René Sitters
    Theoretical Computer Science 460: 70-77, 2012
    
13. Enumerating Minimal Transversals of Geometric Hypergraphs
    Khaled Elbassioni, Imran Rauf, and Saurabh Ray
    In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Canada, 2011, 437-442
    
12. Centerpoints and Tverberg's technique
    Abdul Basit, Nabil H. Mustafa, Saurabh Ray, and Sarfraz Raza
    Computational Geometry 43 (6-7): 593-600, 2010
    
11. Faster algorithms for computing Hong's bound on absolute positiveness
    Kurt Mehlhorn and Saurabh Ray
    Journal of Symbolic Computation 45 (6): 677-683, 2010
    
10. Improved Results on Geometric Hitting Set Problems
    Nabil H. Mustafa and Saurabh Ray
    Discrete & Computational Geometry 44 (4): 883-895, 2010
    
9. On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
   Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
   In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, Paphos, Cyprus, 2009, 275-286
   [PDF: Download: 0901.1140v2.pdf]
   
8. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
   Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
   In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 1210-1219, paper no. 12.B.
   
7. New existence Proofs for epsilon-nets
   Evangelia Pyrga and Saurabh Ray
   In: Proceedings of the twenty-fourth annual symposium on Computational geometry, College Park, MD, USA, 2008, 199-207
   
6. Counting Straight-Edge Triangulations of Planar Point Sets
   Saurabh Ray
   Master's thesis, Universität des Saarlandes, 2004
   
5. An Optimal Generalization of the Centerpoint Theorem, and its Extensions
   Nabil H. Mustafa and Saurabh Ray
   In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), Gyeongju, South Korea, 2007, 138-141
   
   
4. Conflict-free coloring for rectangle ranges using $n^.382$ colors
   Deepak Ajwani, Khaled Elbassioni, Sathish Govindarajan, and Saurabh Ray
   In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, 2007, 181-187
   
3. Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
   Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, and Saurabh Ray
   In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), San Diego, CA, USA, 2007. Note: To Appear
   
2. On Computing the Centroid of the Vertices of an Arrangement and Related Problems
   Deepak Ajwani, Saurabh Ray, Raimund Seidel, and Hans Raj Tiwary
   In: 10th Workshop on Algorithms and Data Structures (WADS), Halifax, Canada, 2007, 519-528
   
1. Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
   Saurabh Ray and Nabil H. Mustafa
   In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), Gyeongju, South Korea, 2007, 239-244