Saurabh Ray
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
22
Venues
14
Active years
2007–2026
Best venue rank
A*
Where they publish
Papers
22 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Model AI Assignments 2026. | Todd W. Neller, Steve Geinitz, Kevin Wang, Zach Dodds, Nicholas Dodds, Ryan O'Connor, Aimen Taha, Ananta Manoranjan, Saurabh Ray, Deepak Ajwani, Fang Sun, Paul Zhang, Pranav Subbaraman, Yizhou Sun, Lisa Dunlap, Taehan Kim, Deena Sun, Ishir Garg, Mark Ogata, Aakarsh Vermani, Narges Norouzi, Joseph Gonzalez, Varada Kolhatkar |
| 2026 | CPAIOR | A Scalable Learning Approach for Efficient Computation of Independent Set and Cover Variants. | Ryan O'Connor, Noah Coleman, Darren Strash, Saurabh Ray, Deepak Ajwani |
| 2026 | ICALP | Geometric Optimization Parameterized by Piercing Complexity. | Aritra Banik, Rajiv Raman, Saurabh Ray |
| 2024 | FedCSIS | An Improved Genetic Algorithm for Set Cover using Rosenthal Potential. | Dena Tayebi, Saurabh Ray, Deepak Ajwani |
| 2024 | INOC | Learning to Prune Instances of Steiner Tree Problem in Graphs. | Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani |
| 2024 | ISAAC | A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles. | Ambar Pal, Rajiv Raman, Saurabh Ray, Karamjeet Singh |
| 2022 | ALENEX | Learning to Prune Instances of | Dena Tayebi, Saurabh Ray, Deepak Ajwani |
| 2021 | ISAAC | On Geometric Priority Set Cover Problems. | Aritra Banik, Rajiv Raman, Saurabh Ray |
| 2020 | ESA | Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. | Rajiv Raman, Saurabh Ray |
| 2018 | ESA | On a Problem of Danzer. | Nabil H. Mustafa, Saurabh Ray |
| 2018 | ESA | Planar Support for Non-piercing Regions and Applications. | Rajiv Raman, Saurabh Ray |
| 2016 | ESA | Packing and Covering with Non-Piercing Regions. | Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy |
| 2015 | ESA | Geometric Hitting Sets for Disks: Theory and Practice. | Norbert Bus, Nabil H. Mustafa, Saurabh Ray |
| 2015 | STACS | Improved Local Search for Geometric Hitting Set. | Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray |
| 2014 | FOCS | Settling the APX-Hardness Status for Geometric Set Cover. | Nabil H. Mustafa, Rajiv Raman, Saurabh Ray |
| 2014 | SODA | Point Line Cover: The Easy Kernel is Essentially Tight. | Stefan Kratsch, Geevarghese Philip, Saurabh Ray |
| 2014 | STACS | Near-Optimal Generalisations of a Theorem of Macbeath. | Nabil H. Mustafa, Saurabh Ray |
| 2011 | ESA | Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. | Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir |
| 2009 | SODA | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, Ren Sitters |
| 2009 | SAGT | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, Ren Sitters |
| 2007 | SPAA | Conflict-free coloring for rectangle ranges using | Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray |
| 2007 | WADS | On Computing the Centroid of the Vertices of an Arrangement and Related Problems. | Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary |