Saurabh Ray

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 25

Top Venues

Discret. Comput. Geom.

CoRR

ESA

Comput. Geom.

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray
Sweeping Arrangements of Non-Piercing Regions in the Plane. SoCG (2024)
Khaled Elbassioni, Saurabh Ray
Geometric Stabbing via Threshold Rounding and Factor Revealing LPs. Discret. Comput. Geom. 71 (3) (2024)
Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray
Sweeping Arrangements of Non-Piercing Curves in Plane. CoRR (2024)
Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani
Learning to Prune Instances of Steiner Tree Problem in Graphs. INOC (2024)
Aritra Banik, Rajiv Raman, Saurabh Ray
On the geometric priority set cover problem. Comput. Geom. 112 (2023)
Dena Tayebi, Saurabh Ray, Deepak Ajwani
-median and Related Problems. ALENEX (2022)
Rajiv Raman, Saurabh Ray
On the Geometric Set Multicover Problem. Discret. Comput. Geom. 68 (2) (2022)
Khaled M. Elbassioni, Saurabh Ray
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems. CoRR (2021)
Aritra Banik, Rajiv Raman, Saurabh Ray
On Geometric Priority Set Cover Problems. ISAAC (2021)
Rajiv Raman, Saurabh Ray
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ESA (2020)
Rajiv Raman, Saurabh Ray
Constructing Planar Support for Non-Piercing Regions. Discret. Comput. Geom. 64 (3) (2020)
Frederik Brinck Jensen, Aadi Joshi, Saurabh Ray
Discrete Helly type theorems. CCCG (2020)
Khaled M. Elbassioni, Imran Rauf, Saurabh Ray
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Theor. Comput. Sci. 767 (2019)
Nabil H. Mustafa, Saurabh Ray
On a Problem of Danzer. Comb. Probab. Comput. 28 (3) (2019)
Aniket Basu Roy, Sathish Govindarajan, Rajiv Raman, Saurabh Ray
Packing and Covering with Non-Piercing Regions. Discret. Comput. Geom. 60 (2) (2018)
Rajiv Raman, Saurabh Ray
Planar Support for Non-piercing Regions and Applications. ESA (2018)
Nabil H. Mustafa, Saurabh Ray
On a Problem of Danzer. ESA (2018)
Norbert Bus, Nabil H. Mustafa, Saurabh Ray
Practical and efficient algorithms for the geometric hitting set problem. Discret. Appl. Math. 240 (2018)
Przemyslaw Koprowski, Kurt Mehlhorn, Saurabh Ray
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. J. Symb. Comput. 87 (2018)
Nabil H. Mustafa, Saurabh Ray
ε -Mnets: Hitting Geometric Set Systems with Subsets. Discret. Comput. Geom. 57 (3) (2017)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. 57 (3) (2017)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Tighter estimates for ϵ-nets for disks. Comput. Geom. 53 (2016)
Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy
Packing and Covering with Non-Piercing Regions. ESA (2016)
Nabil H. Mustafa, Saurabh Ray
An optimal generalization of the Colorful Carathéodory theorem. Discret. Math. 339 (4) (2016)
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
Point Line Cover: The Easy Kernel is Essentially Tight. ACM Trans. Algorithms 12 (3) (2016)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Improved Local Search for Geometric Hitting Set. STACS (2015)
Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48 (5) (2015)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Tighter Estimates for epsilon-nets for Disks. CoRR (2015)
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. 53 (4) (2015)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. SIAM J. Comput. 44 (6) (2015)
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
k-Centerpoints Conjectures for Pointsets in ℝd. Int. J. Comput. Geom. Appl. 25 (3) (2015)
Norbert Bus, Nabil H. Mustafa, Saurabh Ray
Geometric Hitting Sets for Disks: Theory and Practice. ESA (2015)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Settling the APX-Hardness Status for Geometric Set Cover. FOCS (2014)
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
Point Line Cover: The Easy Kernel is Essentially Tight. SODA (2014)
Miriam Farber, Saurabh Ray, Shakhar Smorodinsky
On totally positive matrices and geometric incidences. J. Comb. Theory, Ser. A 128 (2014)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR (2014)
Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
Counting Triangulations and other Crossing-Free Structures Approximately. CoRR (2014)
Nabil H. Mustafa, Saurabh Ray
Near-Optimal Generalisations of a Theorem of Macbeath. STACS (2014)
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR (2013)
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
Point Line Cover: The Easy Kernel is Essentially Tight. CoRR (2013)
Victor Alvarez, Karl Bringmann, Saurabh Ray
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. CoRR (2013)
Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
Counting Triangulations Approximately. CCCG (2013)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On the complexity of the highway problem. Theor. Comput. Sci. 460 (2012)
Nabil H. Mustafa, Saurabh Ray
A theorem of bárány revisited and extended. SCG (2012)
Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discret. Comput. Geom. 48 (1) (2012)
Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
Counting crossing-free structures. SCG (2012)
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. ESA (2011)
Khaled M. Elbassioni, Imran Rauf, Saurabh Ray
Enumerating Minimal Transversals of Geometric Hypergraphs. CCCG (2011)
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
Centerpoints and Tverberg's technique. Comput. Geom. 43 (6-7) (2010)
Nabil H. Mustafa, Saurabh Ray
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 43 (6-7) (2010)
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
. SCG (2010)
Nabil H. Mustafa, Saurabh Ray
Improved Results on Geometric Hitting Set Problems. Discret. Comput. Geom. 44 (4) (2010)
Kurt Mehlhorn, Saurabh Ray
Faster algorithms for computing Hong's bound on absolute positiveness. J. Symb. Comput. 45 (6) (2010)
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
. Discret. Comput. Geom. 44 (3) (2010)
Nabil H. Mustafa, Saurabh Ray
PTAS for geometric hitting set problems via local search. SCG (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems CoRR (2009)
Nabil H. Mustafa, Saurabh Ray
An optimal extension of the centerpoint theorem. Comput. Geom. 42 (6-7) (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA (2009)
Nabil H. Mustafa, Saurabh Ray
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 40 (1) (2008)
Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
Matching edges and faces in polygonal partitions. Comput. Geom. 39 (2) (2008)
Evangelia Pyrga, Saurabh Ray
New existence proofs epsilon-nets. SCG (2008)
Saurabh Ray, Nabil H. Mustafa
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. SCG (2007)
Saurabh Ray, Nabil H. Mustafa
An optimal generalization of the centerpoint theorem, and its extensions. SCG (2007)
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS (2007)
Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray
) colors. SPAA (2007)
Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
Matching Edges and Faces in Polygonal Partitions. CCCG (2005)

Saurabh Ray.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Saurabh Ray