Saurabh Ray

1.4k total citations
69 papers, 790 citations indexed

About

Saurabh Ray is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Pulmonary and Respiratory Medicine. According to data from OpenAlex, Saurabh Ray has authored 69 papers receiving a total of 790 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computer Graphics and Computer-Aided Design, 25 papers in Computational Theory and Mathematics and 13 papers in Pulmonary and Respiratory Medicine. Recurrent topics in Saurabh Ray's work include Computational Geometry and Mesh Generation (33 papers), Advanced Graph Theory Research (20 papers) and Complexity and Algorithms in Graphs (14 papers). Saurabh Ray is often cited by papers focused on Computational Geometry and Mesh Generation (33 papers), Advanced Graph Theory Research (20 papers) and Complexity and Algorithms in Graphs (14 papers). Saurabh Ray collaborates with scholars based in United States, Germany and Pakistan. Saurabh Ray's co-authors include Nabil H. Mustafa, Arijit Ganguli, Machaon Bonafede, Evangelia Pyrga, Elisabeth Hazard, David Klingman, Daniel A. Ollendorf, Vijayveer Bonthapally, Nimish Mohile and Rajiv Raman and has published in prestigious journals such as Journal of Clinical Oncology, Blood and Psychiatry Research.

In The Last Decade

Saurabh Ray

65 papers receiving 761 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Saurabh Ray United States 15 227 190 125 103 100 69 790
Mehmet Deveci Türkiye 15 15 0.1× 43 0.2× 94 0.8× 114 1.1× 74 0.7× 50 617
Hamed Ahmadi United States 23 4 0.0× 6 0.0× 340 2.7× 223 2.2× 157 1.6× 93 1.6k
András Hajdú Hungary 22 10 0.0× 20 0.1× 43 0.3× 126 1.2× 6 0.1× 135 1.9k
Shijun Wang United States 19 3 0.0× 34 0.2× 451 3.6× 149 1.4× 23 0.2× 65 1.8k
Marek Śmieja Poland 11 3 0.0× 44 0.2× 69 0.6× 106 1.0× 21 0.2× 37 839
Yue-Li Wang Taiwan 14 20 0.1× 343 1.8× 39 0.3× 20 0.2× 7 0.1× 99 928
Ying Wu China 15 3 0.0× 10 0.1× 51 0.4× 67 0.7× 83 0.8× 84 1.0k
Miloš Kudělka Czechia 13 6 0.0× 23 0.1× 17 0.1× 53 0.5× 85 0.8× 76 451
John E. Olson United States 18 3 0.0× 208 1.1× 76 0.6× 107 1.0× 37 0.4× 37 969
Donglin Zeng United States 20 4 0.0× 12 0.1× 84 0.7× 56 0.5× 10 0.1× 56 1.6k

Countries citing papers authored by Saurabh Ray

Since Specialization
Citations

This map shows the geographic impact of Saurabh Ray's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Saurabh Ray with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Saurabh Ray more than expected).

Fields of papers citing papers by Saurabh Ray

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Saurabh Ray. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Saurabh Ray. The network helps show where Saurabh Ray may publish in the future.

Co-authorship network of co-authors of Saurabh Ray

This figure shows the co-authorship network connecting the top 25 collaborators of Saurabh Ray. A scholar is included among the top collaborators of Saurabh Ray based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Saurabh Ray. Saurabh Ray is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Raman, Rajiv, et al.. (2023). On the geometric priority set cover problem. Computational Geometry. 112. 101984–101984. 1 indexed citations
2.
Raman, Rajiv & Saurabh Ray. (2020). Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 78. 1 indexed citations
3.
Ray, Saurabh, et al.. (2020). Discrete Helly type theorems.. Canadian Conference on Computational Geometry. 332–335.
4.
Elbassioni, Khaled, et al.. (2018). A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Theoretical Computer Science. 767. 26–33. 2 indexed citations
5.
Chow, Ronald, Saurabh Ray, May Tsao, et al.. (2016). Quality of life with Brain Symptom and Impact Questionnaire in patients with brain metastases. Annals of Palliative Medicine. 5(3). 179–189. 2 indexed citations
6.
Mustafa, Nabil H. & Saurabh Ray. (2015). An optimal generalization of the Colorful Carathéodory theorem. Discrete Mathematics. 339(4). 1300–1305. 2 indexed citations
7.
Stenehjem, David D., et al.. (2015). Treatment Patterns and Outcomes in Patients With Hepatocellular Carcinoma Stratified by Stage-Guided Treatment Categories. Journal of the National Comprehensive Cancer Network. 13(8). 987–994. 7 indexed citations
8.
Ray, Saurabh, et al.. (2014). On totally positive matrices and geometric incidences. Journal of Combinatorial Theory Series A. 128. 149–161. 6 indexed citations
9.
Álvarez, Víctor, Karl Bringmann, Saurabh Ray, & Raimund Seidel. (2013). Counting Triangulations Approximately. MPG.PuRe (Max Planck Society). 85–89.
10.
Elbassioni, Khaled, Rajiv Raman, Saurabh Ray, & René Sitters. (2012). On the complexity of the highway problem. Theoretical Computer Science. 460. 70–77.
11.
Ganguli, Arijit, et al.. (2012). The impact of second-line agents on patients’ health-related quality of life in the treatment for non-small cell lung cancer: a systematic review. Quality of Life Research. 22(5). 1015–1026. 10 indexed citations
12.
Elbassioni, Khaled, et al.. (2011). Enumerating Minimal Transversals of Geometric Hypergraphs. Max Planck Institute for Plasma Physics. 437–442. 1 indexed citations
13.
Mehlhorn, Kurt & Saurabh Ray. (2010). Faster algorithms for computing Hong’s bound on absolute positiveness. Journal of Symbolic Computation. 45(6). 677–683. 14 indexed citations
14.
Mustafa, Nabil H., et al.. (2010). Centerpoints and Tverberg's technique. Computational Geometry. 43(6-7). 593–600. 1 indexed citations
16.
Elbassioni, Khaled, Rajiv Raman, Saurabh Ray, & René Sitters. (2009). On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. Symposium on Discrete Algorithms. 1210–1219. 7 indexed citations
17.
Ollendorf, Daniel A., David Klingman, Elisabeth Hazard, & Saurabh Ray. (2009). Differences in annual medication costs and rates of dosage increase between tumor necrosis factor-antagonist therapies for rheumatoid arthritis in a managed care population. Clinical Therapeutics. 31(4). 825–835. 64 indexed citations
18.
Mustafa, Nabil H. & Saurabh Ray. (2007). Weak ϵ-nets have basis of size O(1/ϵlog(1/ϵ)) in any dimension. Computational Geometry. 40(1). 84–91. 10 indexed citations
19.
Aichholzer, Oswin, Franz Aurenhammer, Thomas Hackl, et al.. (2005). Matching edges and faces in polygonal partitions. MPG.PuRe (Max Planck Society). 126–129. 2 indexed citations
20.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026