An optimal generalization of the centerpoint theorem, and its extensions. - Saurabh Ray; Nabil H. Mustafa (SCG, 2007)

Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. - Saurabh Ray; Nabil H. Mustafa (SCG, 2007)

Conflict-free coloring for rectangle ranges using O(n.382) colors. - Deepak Ajwani; Khaled M. Elbassioni; Sathish Govindarajan; Saurabh Ray (SPAA, 2007)

On Computing the Centroid of the Vertices of an Arrangement and Related Problems. - Deepak Ajwani; Saurabh Ray; Raimund Seidel; Hans Raj Tiwary (WADS, 2007)

New existence proofs epsilon-nets. - Evangelia Pyrga; Saurabh Ray (SCG, 2008)

Matching edges and faces in polygonal partitions. - Oswin Aichholzer; Franz Aurenhammer; Paola Gonzalez-Nava; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Saurabh Ray; Birgit Vogtenhuber (Comput. Geom., 2008)

Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. - Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2008)

PTAS for geometric hitting set problems via local search. - Nabil H. Mustafa; Saurabh Ray (SCG, 2009)

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray; René Sitters (SAGT, 2009)

On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray; René Sitters (SODA, 2009)

An optimal extension of the centerpoint theorem. - Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2009)

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray (CoRR, 2009)

Weak and strong epsilon-nets for geometric range spaces. - Saurabh Ray (2009)

Improving the first selection lemma in R3. - Abdul Basit 001; Nabil H. Mustafa; Saurabh Ray; Sarfraz Raza (SCG, 2010)

Centerpoints and Tverberg's technique. - Abdul Basit 001; Nabil H. Mustafa; Saurabh Ray; Sarfraz Raza (Comput. Geom., 2010)

Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. - Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2010)

Hitting Simplices with Points in R3. - Abdul Basit 001; Nabil H. Mustafa; Saurabh Ray; Sarfraz Raza (Discret. Comput. Geom., 2010)

Improved Results on Geometric Hitting Set Problems. - Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2010)

Faster algorithms for computing Hong's bound on absolute positiveness. - Kurt Mehlhorn; Saurabh Ray (J. Symb. Comput., 2010)

Enumerating Minimal Transversals of Geometric Hypergraphs. - Khaled M. Elbassioni; Imran Rauf; Saurabh Ray (CCCG, 2011)

Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. - Nabil H. Mustafa; Saurabh Ray; Mudassir Shabbir (ESA, 2011)

Counting crossing-free structures. - Victor Alvarez 001; Karl Bringmann; Radu Curticapean; Saurabh Ray (SCG, 2012)

A theorem of bárány revisited and extended. - Nabil H. Mustafa; Saurabh Ray (SCG, 2012)

Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. - Deepak Ajwani; Khaled M. Elbassioni; Sathish Govindarajan; Saurabh Ray (Discret. Comput. Geom., 2012)

On the complexity of the highway problem. - Khaled M. Elbassioni; Rajiv Raman 001; Saurabh Ray; René Sitters (Theor. Comput. Sci., 2012)

Counting Triangulations Approximately. - Victor Alvarez 001; Karl Bringmann; Saurabh Ray; Raimund Seidel (CCCG, 2013)

A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. - Victor Alvarez 001; Karl Bringmann; Saurabh Ray (CoRR, 2013)

Settling the APX-Hardness Status for Geometric Set Cover. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (FOCS, 2014)

Near-Optimal Generalisations of a Theorem of Macbeath. - Nabil H. Mustafa; Saurabh Ray (STACS, 2014)

QPTAS for Geometric Set-Cover Problems via Optimal Separators. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (CoRR, 2014)

On totally positive matrices and geometric incidences. - Miriam Farber; Saurabh Ray; Shakhar Smorodinsky (J. Comb. Theory A, 2014)

Geometric Hitting Sets for Disks: Theory and Practice. - Norbert Bus; Nabil H. Mustafa; Saurabh Ray (ESA, 2015)

Improved Local Search for Geometric Hitting Set. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (STACS, 2015)

Counting triangulations and other crossing-free structures approximately. - Victor Alvarez 001; Karl Bringmann; Saurabh Ray; Raimund Seidel (Comput. Geom., 2015)

Tighter Estimates for epsilon-nets for Disks. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (CoRR, 2015)

Counting Triangulations and Other Crossing-Free Structures via Onion Layers. - Victor Alvarez 001; Karl Bringmann; Radu Curticapean; Saurabh Ray (Discret. Comput. Geom., 2015)

k-Centerpoints Conjectures for Pointsets in ℝd. - Nabil H. Mustafa; Saurabh Ray; Mudassir Shabbir (Int. J. Comput. Geom. Appl., 2015)

Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (SIAM J. Comput., 2015)

Tighter estimates for ϵ-nets for disks. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2016)

An optimal generalization of the Colorful Carathéodory theorem. - Nabil H. Mustafa; Saurabh Ray (Discret. Math., 2016)

Point Line Cover: The Easy Kernel is Essentially Tight. - Stefan Kratsch; Geevarghese Philip; Saurabh Ray (ACM Trans. Algorithms, 2016)

Limits of Local Search: Quality and Efficiency. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2017)

ε -Mnets: Hitting Geometric Set Systems with Subsets. - Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2017)

Planar Support for Non-piercing Regions and Applications. - Rajiv Raman 001; Saurabh Ray (ESA, 2018)

Practical and efficient algorithms for the geometric hitting set problem. - Norbert Bus; Nabil H. Mustafa; Saurabh Ray (Discret. Appl. Math., 2018)

Packing and Covering with Non-Piercing Regions. - Aniket Basu Roy; Sathish Govindarajan; Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2018)

Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. - Przemyslaw Koprowski; Kurt Mehlhorn; Saurabh Ray (J. Symb. Comput., 2018)

On a Problem of Danzer. - Nabil H. Mustafa; Saurabh Ray (Comb. Probab. Comput., 2019)

A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. - Khaled M. Elbassioni; Imran Rauf; Saurabh Ray (Theor. Comput. Sci., 2019)

Discrete Helly type theorems. - Frederik Brinck Jensen; Aadi Joshi; Saurabh Ray (CCCG, 2020)

Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. - Rajiv Raman 001; Saurabh Ray (ESA, 2020)

Constructing Planar Support for Non-Piercing Regions. - Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2020)

On Geometric Priority Set Cover Problems. - Aritra Banik; Rajiv Raman 001; Saurabh Ray (ISAAC, 2021)

Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems. - Khaled M. Elbassioni; Saurabh Ray (CoRR, 2021)

Learning to Prune Instances of k-median and Related Problems. - Dena Tayebi; Saurabh Ray; Deepak Ajwani (ALENEX, 2022)

On the Geometric Set Multicover Problem. - Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2022)

On the geometric priority set cover problem. - Aritra Banik; Rajiv Raman 001; Saurabh Ray (Comput. Geom., 2023)

Sweeping Arrangements of Non-Piercing Regions in the Plane. - Suryendu Dalal; Rahul Gangopadhyay; Rajiv Raman 001; Saurabh Ray (SoCG, 2024)

An Improved Genetic Algorithm for Set Cover using Rosenthal Potential. - Dena Tayebi; Saurabh Ray; Deepak Ajwani (FedCSIS, 2024)

Learning to Prune Instances of Steiner Tree Problem in Graphs. - Jiwei Zhang 013; Dena Tayebi; Saurabh Ray; Deepak Ajwani (INOC, 2024)

A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles. - Ambar Pal; Rajiv Raman 001; Saurabh Ray; Karamjeet Singh 002 (ISAAC, 2024)

Effectiveness of SDP Rounding Using Hopfield Networks. - Éanna Curran; Saurabh Ray; Deepak Ajwani (LoG, 2024)

Sweeping Arrangements of Non-Piercing Curves in Plane. - Suryendu Dalal; Rahul Gangopadhyay; Rajiv Raman 001; Saurabh Ray (CoRR, 2024)

Geometric Stabbing via Threshold Rounding and Factor Revealing LPs. - Khaled Elbassioni; Saurabh Ray (Discret. Comput. Geom., 2024)