Homepage
Saurabh Ray
Max-Planck-Institut
für
Informatik
Department 1:
Algorithms and Complexity
Campus E1 4, Room 319
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone:
+49 681 9325 1019
Fax: +49 681 9325 199
- Discrete and Computational Geometry
- Extremal Combinatorics
JOURNAL PAPERS
- Centerpoints and Tverberg's
Technique
with Abdul Basit, Nabil
Mustafa and Sarfraz Raza
Computational Geometry: Theory and Applications , 2010
- An Optimal
Generalization of the Centerpoint Theorem
with Nabil Mustafa
Computational Geometry: Theory and Applications ,
2008
- Weak ε-nets have a Basis
of size O(1/ε log 1/ε)
with Nabil Mustafa
Computational Geometry: Theory and Applications ,
2008
- Matching Edges and
Faces in Polygonal Partitions
with Oswin
Aichholzer, Franz
Aurenhammer ,
Paola Gonzalez-Nava, Thomas
Hackl,
Clemens Huemer, Ferran
Hurtado, Hannes
Krasser
and Birgit Vogtenhuber
Computational Geometry: Theory and Applications ,
2008
REFEREED CONFERENCES
- On
Profit-Maximizing Pricing for the Highway and Tollbooth
Problems
with Khaled M. Elbassioni,
Rajiv Raman and Rene Sitters
Proc. of 2nd Symposium on Algorithmic
Game Theory (SAGT), 2009.
- On the approximability
of the maximum feasible subsystem problem with 0/1-coefficients
with Khaled Elbassioni, Rajiv Raman and Rene Sitters
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2009
- New Existence proofs for
ε-Nets
with Evangelia
Pyrga
Proc. of the 24th ACM Symposium on Computational Geometry (SoCG
), 2008.
- On Computing the
Centroid of the Vertices of an Arrangement and Related Problems
with Deepak
Ajwani, Raimund Seidel
and Hans Raj Tiwary
Workshop on Algorithms and Data Structures (WADS), Halifax,
Canada, 2007
- Conflict-Free Coloring
for Rectangle Ranges Using O(n0.382+ε) Colors
with Deepak
Ajwani, Khaled
Elbassioni, Sathish
Govindarajan
Symposium on Parallelism in Algorithms and Architectures
(SPAA), San Diego, CA, USA, 2007
- Weak ε-nets have a
Basis of size O(1/ε log 1/ε)
with Nabil
Mustafa
Proc. of the 23rd ACM Symposium on Computational Geometry (SoCG),
2007.
- An Optimal
Generalization of the Centerpoint Theorem
with Nabil
Mustafa
Proc. of the 23rd ACM Symposium on Computational Geometry (SoCG),
2007.
- Matching Edges and
Faces in Polygonal Partitions
with Oswin
Aichholzer, Franz
Aurenhammer ,
Paola Gonzalez-Nava, Thomas
Hackl,
Clemens Huemer, Ferran
Hurtado, Hannes
Krasser
and Birgit Vogtenhuber
Canadian Conference on Computational Geometry 2005
- A Simple and
Less Slow Method for Counting Triangulations and for Related Problems
with Raimund Seidel
European Workshop on Computational Geometry 2004
Discrete
Geometry
Topological
Methods
in
Geometry
- February 2011 - present : post doctoral researcher at Kurt
Mehlhorn's group at
Max-Planck-Institut
für
Informatik,
Germany
- February 2010 - January 2011: post doctoral researcher Janos Pach's group at École polytechnique fédérale de Lausanne,
Switzerland
