R. Ravi

8.2k total citations
175 papers, 3.5k citations indexed

About

R. Ravi is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, R. Ravi has authored 175 papers receiving a total of 3.5k indexed citations (citations by other indexed papers that have themselves been cited), including 88 papers in Computational Theory and Mathematics, 72 papers in Computer Networks and Communications and 37 papers in Industrial and Manufacturing Engineering. Recurrent topics in R. Ravi's work include Complexity and Algorithms in Graphs (82 papers), Advanced Graph Theory Research (60 papers) and Optimization and Search Problems (50 papers). R. Ravi is often cited by papers focused on Complexity and Algorithms in Graphs (82 papers), Advanced Graph Theory Research (60 papers) and Optimization and Search Problems (50 papers). R. Ravi collaborates with scholars based in United States, Germany and Canada. R. Ravi's co-authors include Philip N. Klein, Amitabh Sinha, Jochen Könemann, Ajit Agrawal, Goran Konjevod, Naveen Garg, Viswanath Nagarajan, Anupam Gupta, Daniel J. Rosenkrantz and Madhav Marathe and has published in prestigious journals such as Management Science, Journal of Marketing Research and European Journal of Operational Research.

In The Last Decade

R. Ravi

162 papers receiving 3.2k citations

Peers

R. Ravi
Maxim Sviridenko United States
Naveen Garg India
Chandra Chekuri United States
Ulrich Pferschy Austria
Samir Khuller United States
Yossi Azar Israel
Nikhil Bansal United States
Baruch Schieber United States
David Connolly United Kingdom
Refael Hassin Israel
Maxim Sviridenko United States
R. Ravi
Citations per year, relative to R. Ravi R. Ravi (= 1×) peers Maxim Sviridenko

Countries citing papers authored by R. Ravi

Since Specialization
Citations

This map shows the geographic impact of R. Ravi'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 R. Ravi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites R. Ravi more than expected).

Fields of papers citing papers by R. Ravi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by R. Ravi. 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 R. Ravi. The network helps show where R. Ravi may publish in the future.

Co-authorship network of co-authors of R. Ravi

This figure shows the co-authorship network connecting the top 25 collaborators of R. Ravi. A scholar is included among the top collaborators of R. Ravi 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 R. Ravi. R. Ravi 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.
Ravi, R., et al.. (2025). Exosome-Based Sensor: A Landmark of the Precision Cancer Diagnostic Era. ACS Applied Bio Materials. 8(6). 4489–4513. 1 indexed citations
2.
Carr, Robert D., et al.. (2022). A new integer programming formulation of the graphical traveling salesman problem. Mathematical Programming. 197(2). 877–902. 5 indexed citations
3.
Ravi, R., et al.. (2021). Effective Online Order Acceptance Policies for Omnichannel Fulfillment. Manufacturing & Service Operations Management. 24(3). 1650–1663. 11 indexed citations
4.
Moseley, Benjamin, et al.. (2021). Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 3 indexed citations
5.
Gupta, Anupam, Ravishankar Krishnaswamy, Viswanath Nagarajan, & R. Ravi. (2012). Approximation algorithms for stochastic orienteering. Symposium on Discrete Algorithms. 1522–1538. 21 indexed citations
6.
Blelloch, Guy E., et al.. (2011). An Optimization-Based Sampling Scheme for Phylogenetic Trees. Journal of Computational Biology. 18(11). 1599–1609. 1 indexed citations
7.
Frieze, Alan, et al.. (2007). Line-of-sight networks. Symposium on Discrete Algorithms. 968–977. 2 indexed citations
8.
Gupta, Anupam, Jochen Könemann, Stefano Leonardi, R. Ravi, & Guido Schäfer. (2007). An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Symposium on Discrete Algorithms. 1153–1162. 15 indexed citations
9.
Ravi, R. & Amitabh Sinha. (2002). Approximating k-cuts via network strength. Symposium on Discrete Algorithms. 621–622. 10 indexed citations
10.
Konjevod, Goran & R. Ravi. (2000). An approximation algorithm for the covering Steiner problem. Symposium on Discrete Algorithms. 338–344. 10 indexed citations
11.
Blum, Avrim, R. Ravi, & Santosh Vempala. (1999). A Constant-Factor Approximation Algorithm for thek-MST Problem. Journal of Computer and System Sciences. 58(1). 101–108. 43 indexed citations
12.
Garg, Naveen, Goran Konjevod, & R. Ravi. (1998). A polylogarithmic approximation algorithm for the group Steiner tree problem. Symposium on Discrete Algorithms. 37(1). 253–259. 36 indexed citations
13.
Ravi, R. & John Kececioglu. (1998). Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree. Discrete Applied Mathematics. 88(1-3). 355–366. 9 indexed citations
14.
Ravi, R. & Michel X. Goemans. (1996). The Constrained Minimum Spanning Tree Problem (Extended Abstract). 66–75. 31 indexed citations
15.
Marathe, Madhav, R. Ravi, & Ravi Sundaram. (1996). Service-constrained network design problems. Nordic journal of computing. 3(4). 367–387. 3 indexed citations
16.
Krumke, Sven O., et al.. (1996). On optimal strategies for upgrading networks. University of North Texas Digital Library (University of North Texas). 1 indexed citations
17.
Bafna, Vineet, et al.. (1996). Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles). Discrete Applied Mathematics. 71(1-3). 41–53. 37 indexed citations
18.
Ravi, R. & David P. Williamson. (1995). An approximation algorithm for minimum-cost vertex-connectivity problems. Symposium on Discrete Algorithms. 1000–1001. 7 indexed citations
19.
Ravi, R., et al.. (1994). Spanning trees short or small. arXiv (Cornell University). 546–555. 32 indexed citations
20.
Ravi, R. & Philip N. Klein. (1992). When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems. 39–55. 26 indexed citations

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

Breakdown of academic impact, for papers by Maxim Sviridenko Breakdown of academic impact, for papers by Naveen Garg Breakdown of academic impact, for papers by Chandra Chekuri Breakdown of academic impact, for papers by Ulrich Pferschy Breakdown of academic impact, for papers by Samir Khuller Breakdown of academic impact, for papers by Yossi Azar Breakdown of academic impact, for papers by Nikhil Bansal Breakdown of academic impact, for papers by Baruch Schieber Breakdown of academic impact, for papers by David Connolly Breakdown of academic impact, for papers by Refael Hassin
Rankless by CCL
2026