Follow
Saurabh Ray
Title
Cited by
Cited by
Year
Improved results on geometric hitting set problems
NH Mustafa, S Ray
Discrete & Computational Geometry 44, 883-895, 2010
2622010
PTAS for geometric hitting set problems via local search
NH Mustafa, S Ray
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
1062009
New existence proofs ε-nets
E Pyrga, S Ray
Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008
1032008
Point line cover: The easy kernel is essentially tight
S Kratsch, G Philip, S Ray
ACM Transactions On Algorithms (TALG) 12 (3), 1-16, 2016
552016
Settling the APX-hardness status for geometric set cover
NH Mustafa, R Raman, S Ray
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 541-550, 2014
412014
Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces
NH Mustafa, R Raman, S Ray
SIAM Journal on Computing 44 (6), 1650-1669, 2015
402015
Conflict-free coloring for rectangle ranges using O(n.382) colors
D Ajwani, K Elbassioni, S Govindarajan, S Ray
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
392007
On profit-maximizing pricing for the highway and tollbooth problems
K Elbassioni, R Raman, S Ray, R Sitters
International Symposium on Algorithmic Game Theory, 275-286, 2009
342009
Faster algorithms for computing Hong’s bound on absolute positiveness
K Mehlhorn, S Ray
Journal of Symbolic Computation 45 (6), 677-683, 2010
302010
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
K Elbassioni, R Raman, S Ray, R Sitters
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
262009
Weak ϵ-nets have basis of size O (1/ϵlog (1/ϵ)) in any dimension
NH Mustafa, S Ray
Computational Geometry 40 (1), 84-91, 2008
25*2008
Tighter estimates for ϵ-nets for disks
N Bus, S Garg, NH Mustafa, S Ray
Computational Geometry 53, 27-35, 2016
24*2016
Packing and covering with non-piercing regions
A Basu Roy, S Govindarajan, R Raman, S Ray
Discrete & Computational Geometry 60, 471-492, 2018
232018
Practical and efficient algorithms for the geometric hitting set problem
N Bus, NH Mustafa, S Ray
Discrete Applied Mathematics 240, 25-32, 2018
232018
Packing and covering with non-piercing regions
S Govindarajan, R Raman, S Ray, A Basu Roy
24th Annual European Symposium on Algorithms (ESA 2016), 2016
212016
An optimal extension of the centerpoint theorem
NH Mustafa, S Ray
Computational Geometry 42 (6-7), 505-510, 2009
212009
Limits of local search: Quality and efficiency
N Bus, S Garg, NH Mustafa, S Ray
Discrete & Computational Geometry 57, 607-624, 2017
192017
A simple and less slow method for counting triangulations and for related problems
S Ray, R Seidel
20th European Workshop on Computational Geometry (2004)., 2004
192004
Near-optimal generalisations of a theorem of Macbeath
NH Mustafa, S Ray
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
172014
Counting triangulations and other crossing-free structures via onion layers
V Alvarez, K Bringmann, R Curticapean, S Ray
Discrete & Computational Geometry 53 (4), 675-690, 2015
162015
The system can't perform the operation now. Try again later.
Articles 1–20