Saurabh Ray
Saurabh Ray
NYU Abu Dhabi
Dirección de correo verificada de nyu.edu
Título
Citado por
Citado por
Año
Improved results on geometric hitting set problems
NH Mustafa, S Ray
Discrete & Computational Geometry 44 (4), 883-895, 2010
1982010
PTAS for geometric hitting set problems via local search
NH Mustafa, S Ray
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
902009
New existence proofs ε-nets
E Pyrga, S Ray
Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008
892008
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
402007
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
382016
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
332009
Faster algorithms for computing Hong’s bound on absolute positiveness
K Mehlhorn, S Ray
Journal of Symbolic Computation 45 (6), 677-683, 2010
282010
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
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
222014
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
212015
Weak ϵ-nets have basis of size O (1/ϵlog (1/ϵ)) in any dimension
NH Mustafa, S Ray
Computational Geometry 40 (1), 84-91, 2008
21*2008
Exact and efficient generation of geometric random variates and random graphs
K Bringmann, T Friedrich
International Colloquium on Automata, Languages, and Programming, 267-278, 2013
202013
A simple and less slow method for counting triangulations and for related problems
S Ray, R Seidel
182004
Tighter estimates for ϵ-nets for disks
N Bus, S Garg, NH Mustafa, S Ray
Computational Geometry 53, 27-35, 2016
162016
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
162016
QPTAS for geometric set-cover problems via optimal separators
NH Mustafa, R Raman, S Ray
arXiv preprint arXiv:1403.0835, 2014
152014
Counting crossing-free structures
V Alvarez, K Bringmann, R Curticapean, S Ray
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
152012
Limits of local search: Quality and efficiency
N Bus, S Garg, NH Mustafa, S Ray
Discrete & Computational Geometry 57 (3), 607-624, 2017
142017
Near-optimal generalisations of a theorem of Macbeath
NH Mustafa, S Ray
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
142014
An optimal extension of the centerpoint theorem
NH Mustafa, S Ray
Computational Geometry 42 (6-7), 505-510, 2009
142009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20