| 2009 |
|---|
| 10 | EE | Khaled M. Elbassioni,
Rajiv Raman,
Saurabh Ray,
René Sitters:
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
SODA 2009: 1210-1219 |
| 9 | EE | Khaled M. Elbassioni,
Rajiv Raman,
Saurabh Ray:
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
CoRR abs/0901.1140: (2009) |
| 2008 |
|---|
| 8 | EE | Evangelia Pyrga,
Saurabh Ray:
New existence proofs epsilon-nets.
Symposium on Computational Geometry 2008: 199-207 |
| 7 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Paola Gonzalez-Nava,
Thomas Hackl,
Clemens Huemer,
Ferran Hurtado,
Hannes Krasser,
Saurabh Ray,
Birgit Vogtenhuber:
Matching edges and faces in polygonal partitions.
Comput. Geom. 39(2): 134-141 (2008) |
| 6 | EE | Nabil H. Mustafa,
Saurabh Ray:
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.
Comput. Geom. 40(1): 84-91 (2008) |
| 2007 |
|---|
| 5 | EE | Deepak Ajwani,
Khaled M. Elbassioni,
Sathish Govindarajan,
Saurabh Ray:
Conflict-free coloring for rectangle ranges using O(n.382) colors.
SPAA 2007: 181-187 |
| 4 | EE | Saurabh Ray,
Nabil H. Mustafa:
An optimal generalization of the centerpoint theorem, and its extensions.
Symposium on Computational Geometry 2007: 138-141 |
| 3 | EE | Saurabh Ray,
Nabil H. Mustafa:
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension.
Symposium on Computational Geometry 2007: 239-244 |
| 2 | EE | Deepak Ajwani,
Saurabh Ray,
Raimund Seidel,
Hans Raj Tiwary:
On Computing the Centroid of the Vertices of an Arrangement and Related Problems.
WADS 2007: 519-528 |
| 2005 |
|---|
| 1 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Paola Gonzalez-Nava,
Thomas Hackl,
Clemens Huemer,
Ferran Hurtado,
Hannes Krasser,
Saurabh Ray,
Birgit Vogtenhuber:
Matching Edges and Faces in Polygonal Partitions.
CCCG 2005: 126-129 |
