default search action
Saurabh Ray
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Khaled Elbassioni, Saurabh Ray:
Geometric Stabbing via Threshold Rounding and Factor Revealing LPs. Discret. Comput. Geom. 71(3): 787-822 (2024) - [c29]Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray:
Sweeping Arrangements of Non-Piercing Regions in the Plane. SoCG 2024: 45:1-45:15 - [c28]Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of Steiner Tree Problem in Graphs. INOC 2024: 40-45 - [i10]Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray:
Sweeping Arrangements of Non-Piercing Curves in Plane. CoRR abs/2403.16474 (2024) - [i9]Ambar Pal, Rajiv Raman, Saurabh Ray, Karamjeet Singh:
A fast algorithm for computing a planar support for non-piercing rectangles. CoRR abs/2410.02449 (2024) - 2023
- [j28]Aritra Banik
, Rajiv Raman, Saurabh Ray:
On the geometric priority set cover problem. Comput. Geom. 112: 101984 (2023) - 2022
- [j27]Rajiv Raman, Saurabh Ray:
On the Geometric Set Multicover Problem. Discret. Comput. Geom. 68(2): 566-591 (2022) - [c27]Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of k-median and Related Problems. ALENEX 2022: 184-194 - 2021
- [c26]Aritra Banik, Rajiv Raman, Saurabh Ray:
On Geometric Priority Set Cover Problems. ISAAC 2021: 12:1-12:14 - [i8]Khaled M. Elbassioni, Saurabh Ray:
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems. CoRR abs/2106.12385 (2021) - 2020
- [j26]Rajiv Raman, Saurabh Ray:
Constructing Planar Support for Non-Piercing Regions. Discret. Comput. Geom. 64(3): 1098-1122 (2020) - [c25]Frederik Brinck Jensen, Aadi Joshi, Saurabh Ray:
Discrete Helly type theorems. CCCG 2020: 332-335 - [c24]Rajiv Raman, Saurabh Ray:
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ESA 2020: 78:1-78:16
2010 – 2019
- 2019
- [j25]Nabil H. Mustafa, Saurabh Ray:
On a Problem of Danzer. Comb. Probab. Comput. 28(3): 473-482 (2019) - [j24]Khaled M. Elbassioni
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Theor. Comput. Sci. 767: 26-33 (2019) - 2018
- [j23]Norbert Bus, Nabil H. Mustafa
Practical and efficient algorithms for the geometric hitting set problem. Discret. Appl. Math. 240: 25-32 (2018) - [j22]Aniket Basu Roy
Packing and Covering with Non-Piercing Regions. Discret. Comput. Geom. 60(2): 471-492 (2018) - [j21]Przemyslaw Koprowski
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. J. Symb. Comput. 87: 238-241 (2018) - [c23]Nabil H. Mustafa
On a Problem of Danzer. ESA 2018: 64:1-64:8 - [c22]Rajiv Raman, Saurabh Ray:
Planar Support for Non-piercing Regions and Applications. ESA 2018: 69:1-69:14 - 2017
- [j20]Norbert Bus, Shashwat Garg, Nabil H. Mustafa
Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. 57(3): 607-624 (2017) - [j19]Nabil H. Mustafa
ε -Mnets: Hitting Geometric Set Systems with Subsets. Discret. Comput. Geom. 57(3): 625-640 (2017) - 2016
- [j18]Norbert Bus, Shashwat Garg, Nabil H. Mustafa
Tighter estimates for ϵ-nets for disks. Comput. Geom. 53: 27-35 (2016) - [j17]Nabil H. Mustafa
An optimal generalization of the Colorful Carathéodory theorem. Discret. Math. 339(4): 1300-1305 (2016) - [j16]Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. ACM Trans. Algorithms 12(3): 40:1-40:16 (2016) - [c21]Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy
Packing and Covering with Non-Piercing Regions. ESA 2016: 47:1-47:17 - 2015
- [j15]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5): 386-397 (2015) - [j14]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. 53(4): 675-690 (2015) - [j13]Nabil H. Mustafa
k-Centerpoints Conjectures for Pointsets in ℝd. Int. J. Comput. Geom. Appl. 25(3): 163-186 (2015) - [j12]Nabil H. Mustafa
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. SIAM J. Comput. 44(6): 1650-1669 (2015) - [c20]Norbert Bus, Nabil H. Mustafa
Geometric Hitting Sets for Disks: Theory and Practice. ESA 2015: 903-914 - [c19]Norbert Bus, Shashwat Garg, Nabil H. Mustafa
Improved Local Search for Geometric Hitting Set. STACS 2015: 184-196 - [i7]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Tighter Estimates for epsilon-nets for Disks. CoRR abs/1501.03246 (2015) - 2014
- [j11]Miriam Farber
On totally positive matrices and geometric incidences. J. Comb. Theory A 128: 149-161 (2014) - [c18]Nabil H. Mustafa
Settling the APX-Hardness Status for Geometric Set Cover. FOCS 2014: 541-550 - [c17]Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. SODA 2014: 1596-1606 - [c16]Nabil H. Mustafa
Near-Optimal Generalisations of a Theorem of Macbeath. STACS 2014: 578-589 - [i6]Nabil H. Mustafa, Rajiv Raman, Saurabh Ray:
QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR abs/1403.0835 (2014) - [i5]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations and other Crossing-Free Structures Approximately. CoRR abs/1404.0261 (2014) - 2013
- [c15]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations Approximately. CCCG 2013 - [i4]Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. CoRR abs/1307.2521 (2013) - [i3]Victor Alvarez, Karl Bringmann, Saurabh Ray:
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. CoRR abs/1312.3188 (2013) - [i2]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR abs/1312.4628 (2013) - 2012
- [j10]Deepak Ajwani
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discret. Comput. Geom. 48(1): 39-52 (2012) - [j9]Khaled M. Elbassioni
On the complexity of the highway problem. Theor. Comput. Sci. 460: 70-77 (2012) - [c14]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting crossing-free structures. SCG 2012: 61-68 - [c13]Nabil H. Mustafa
A theorem of bárány revisited and extended. SCG 2012: 333-338 - 2011
- [c12]Khaled M. Elbassioni, Imran Rauf, Saurabh Ray:
Enumerating Minimal Transversals of Geometric Hypergraphs. CCCG 2011 - [c11]Nabil H. Mustafa
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. ESA 2011: 506-517 - 2010
- [j8]Nabil H. Mustafa
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 43(6-7): 565-571 (2010) - [j7]Abdul Basit
Centerpoints and Tverberg's technique. Comput. Geom. 43(6-7): 593-600 (2010) - [j6]Abdul Basit
Hitting Simplices with Points in R3. Discret. Comput. Geom. 44(3): 637-644 (2010) - [j5]Nabil H. Mustafa
Improved Results on Geometric Hitting Set Problems. Discret. Comput. Geom. 44(4): 883-895 (2010) - [j4]Kurt Mehlhorn, Saurabh Ray:
Faster algorithms for computing Hong's bound on absolute positiveness. J. Symb. Comput. 45(6): 677-683 (2010) - [c10]Abdul Basit
Improving the first selection lemma in R3. SCG 2010: 354-357
2000 – 2009
- 2009
- [b1]Saurabh Ray:
Weak and strong epsilon-nets for geometric range spaces. Saarland University, Saarbrücken, Germany, 2009 - [j3]Nabil H. Mustafa
An optimal extension of the centerpoint theorem. Comput. Geom. 42(6-7): 505-510 (2009) - [c9]Nabil H. Mustafa
PTAS for geometric hitting set problems via local search. SCG 2009: 17-22 - [c8]Khaled M. Elbassioni
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286 - [c7]Khaled M. Elbassioni
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219 - [i1]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray:
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. CoRR abs/0901.1140 (2009) - 2008
- [j2]Oswin Aichholzer
Matching edges and faces in polygonal partitions. Comput. Geom. 39(2): 134-141 (2008) - [j1]Nabil H. Mustafa
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 40(1): 84-91 (2008) - [c6]Evangelia Pyrga, Saurabh Ray:
New existence proofs epsilon-nets. SCG 2008: 199-207 - 2007
- [c5]Saurabh Ray, Nabil H. Mustafa
An optimal generalization of the centerpoint theorem, and its extensions. SCG 2007: 138-141 - [c4]Saurabh Ray, Nabil H. Mustafa
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. SCG 2007: 239-244 - [c3]Deepak Ajwani
Conflict-free coloring for rectangle ranges using O(n.382) colors. SPAA 2007: 181-187 - [c2]Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS 2007: 519-528 - 2005
- [c1]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: 126-129
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: