Saurabh Ray

Получаване на мой собствен потребителски профил

Позовавания

	Всички	От 2020
Позовавания	1235	429
h-индекс	18	11
i10-индекс	31	13

120

20072008200920102011201220132014201520162017201820192020202120222023202420255 4 34 37 38 48 64 82 95 96 92 107 94 104 71 79 69 90 16

Публичен достъп

Преглед на всички

6 статии

0 статии

налични

неналични

Въз основа на изисквания при финансирането

Съавтори

Rajiv RamanIowa, Warwick, MPI, IIITПотвърден имейл адрес: iiitd.ac.in
Deepak AjwaniUniversity College DublinПотвърден имейл адрес: ucd.ie
Karl BringmannProfessor in Computer Science, Saarland UniversityПотвърден имейл адрес: cs.uni-saarland.de
Victor AlvarezResearch Associate at TU BraunschweigПотвърден имейл адрес: victoralvarez.net
Sathish GovindarajanAssociate Professor, Computer Science, Indian Institute of ScienceПотвърден имейл адрес: csa.iisc.ernet.in
Raimund SeidelProfessor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZIПотвърден имейл адрес: cs.uni-saarland.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusПотвърден имейл адрес: mpi-inf.mpg.de
Aniket Basu RoyBITS Pilani, GoaПотвърден имейл адрес: iisc.ac.in
Abdul BasitMonash UniversityПотвърден имейл адрес: monash.edu
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteПотвърден имейл адрес: cmi.ac.in
Stefan KratschProfessor at Humboldt University BerlinПотвърден имейл адрес: informatik.hu-berlin.de
Hans Raj TiwaryCharles University, PragueПотвърден имейл адрес: kam.mff.cuni.cz
mudassir shabbirVanderbilt University, Information Technology University, Rutgers UniversityПотвърден имейл адрес: rutgers.edu
Imran RaufIBA, KarachiПотвърден имейл адрес: iba.edu.pk
Franz AurenhammerProfessor for Theoretical Computer Science, TU Graz, AustriaПотвърден имейл адрес: igi.tugraz.at
Clemens HuemerUniversitat Politècnica de CatalunyaПотвърден имейл адрес: upc.edu
Shakhar SmorodinskyBen-Gurion University of the NegevПотвърден имейл адрес: bgu.ac.il

Следене

Saurabh Ray

NYU Abu Dhabi

Потвърден имейл адрес: nyu.edu

Discrete and Computational Geometry Approximation Algorithms Extremal Combinatorics


Заглавие Сортиране по цитати Сортиране по година Сортиране по заглавие	Позовавания Позовавания	Година
Improved results on geometric hitting set problems NH Mustafa, S Ray Discrete & Computational Geometry 44, 883-895, 2010	281	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	110	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	58	2016
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	43	2007
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	42	2015
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
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	35	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
Practical and efficient algorithms for the geometric hitting set problem N Bus, NH Mustafa, S Ray Discrete Applied Mathematics 240, 25-32, 2018	27	2018
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	27	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
Tighter estimates for ϵ-nets for disks N Bus, S Garg, NH Mustafa, S Ray Computational Geometry 53, 27-35, 2016	23	2016
Weak ϵ-nets have basis of size O (1/ϵlog (1/ϵ)) in any dimension NH Mustafa, S Ray Computational Geometry 40 (1), 84-91, 2008	22*	2008
Packing and covering with non-piercing regions S Govindarajan, R Raman, S Ray, A Basu Roy 24th Annual European Symposium on Algorithms (ESA 2016), 47: 1-47: 17, 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	20	2017
A simple and less slow method for counting triangulations and for related problems S Ray, R Seidel	18	2004
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
Near-optimal generalisations of a theorem of Macbeath NH Mustafa, S Ray 31st International Symposium on Theoretical Aspects of Computer Science …, 2014	17	2014

Системата не може да изпълни операцията сега. Опитайте отново по-късно.

Статии 1–20

Позовавания годишно

Дублирани описания

Обединени библиографски описания

Добавяне на съавториСъавтори

Следене

Позовавания

Съавтори