Saurabh Ray

Cited by

	All	Since 2019
Citations	1205	499
h-index	18	12
i10-index	30	16

120

2007200820092010201120122013201420152016201720182019202020212022202320245 4 34 36 39 48 63 74 93 95 92 107 93 103 70 83 70 80

Public access

View all

6 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Rajiv RamanIowa, Warwick, MPI, IIITVerified email at iiitd.ac.in
Deepak AjwaniUniversity College DublinVerified email at ucd.ie
Karl BringmannProfessor in Computer Science, Saarland UniversityVerified email at cs.uni-saarland.de
Victor AlvarezResearch Associate at TU BraunschweigVerified email at victoralvarez.net
Sathish GovindarajanAssociate Professor, Computer Science, Indian Institute of ScienceVerified email at csa.iisc.ernet.in
Raimund SeidelProfessor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZIVerified email at cs.uni-saarland.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Aniket Basu RoyAarhus UniversityVerified email at iisc.ac.in
Abdul BasitMonash UniversityVerified email at monash.edu
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerified email at cmi.ac.in
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
mudassir shabbirVanderbilt University, Information Technology University, Rutgers UniversityVerified email at rutgers.edu
Franz AurenhammerProfessor for Theoretical Computer Science, TU Graz, AustriaVerified email at igi.tugraz.at
Imran RaufIBA, KarachiVerified email at iba.edu.pk
Hans Raj TiwaryCharles University, PragueVerified email at kam.mff.cuni.cz
Clemens HuemerUniversitat Politècnica de CatalunyaVerified email at upc.edu
Shakhar SmorodinskyBen-Gurion University of the NegevVerified email at bgu.ac.il

Saurabh Ray

NYU Abu Dhabi

Verified email at nyu.edu

Discrete and Computational Geometry Approximation Algorithms Extremal Combinatorics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Improved results on geometric hitting set problems NH Mustafa, S Ray Discrete & Computational Geometry 44, 883-895, 2010	270	2010
PTAS for geometric hitting set problems via local search NH Mustafa, S Ray Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009	108	2009
New existence proofs ε-nets E Pyrga, S Ray Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008	103	2008
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	57	2016
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	41	2014
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	40	2015
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	39	2007
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	34	2009
Faster algorithms for computing Hong’s bound on absolute positiveness K Mehlhorn, S Ray Journal of Symbolic Computation 45 (6), 677-683, 2010	30	2010
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	26	2009
Packing and covering with non-piercing regions A Basu Roy, S Govindarajan, R Raman, S Ray Discrete & Computational Geometry 60, 471-492, 2018	25	2018
Practical and efficient algorithms for the geometric hitting set problem N Bus, NH Mustafa, S Ray Discrete Applied Mathematics 240, 25-32, 2018	25	2018
Weak ϵ-nets have basis of size O (1/ϵlog (1/ϵ)) in any dimension NH Mustafa, S Ray Computational Geometry 40 (1), 84-91, 2008	24*	2008
Tighter estimates for ϵ-nets for disks N Bus, S Garg, NH Mustafa, S Ray Computational Geometry 53, 27-35, 2016	23	2016
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	21	2016
An optimal extension of the centerpoint theorem NH Mustafa, S Ray Computational Geometry 42 (6-7), 505-510, 2009	21	2009
Limits of local search: Quality and efficiency N Bus, S Garg, NH Mustafa, S Ray Discrete & Computational Geometry 57, 607-624, 2017	19	2017
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	18	2004
-Mnets: Hitting Geometric Set Systems with Subsets NH Mustafa, S Ray Discrete & Computational Geometry 57 (3), 625-640, 2017	17	2017
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	17	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors