Saurabh Ray - RankMe

74 papers A* 5A 9B 5C 2Journal 40Unranked 12

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