Satish Rao

1.8k total citations
30 papers, 956 citations indexed

About

Satish Rao is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Satish Rao has authored 30 papers receiving a total of 956 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 11 papers in Electrical and Electronic Engineering. Recurrent topics in Satish Rao's work include Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (16 papers) and Optimization and Search Problems (10 papers). Satish Rao is often cited by papers focused on Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (16 papers) and Optimization and Search Problems (10 papers). Satish Rao collaborates with scholars based in United States, Canada and Germany. Satish Rao's co-authors include Philip N. Klein, Serge Plotkin, Sairam Subramanian, Monika Henzinger, Chris Harrelson, Baruch Schieber, Joseph Naor, Guy Even, Kirsten Hildrum and Andréa W. Richa and has published in prestigious journals such as SIAM Journal on Computing, Journal of Computer and System Sciences and Journal of Algorithms.

In The Last Decade

Satish Rao

30 papers receiving 876 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Satish Rao United States	14	607	466	199	156	122	30	956
Elias Dahlhaus Germany	13	618 1.0×	287 0.6×	85 0.4×	80 0.5×	157 1.3×	45	937
Sanjiv Kapoor United States	17	327 0.5×	269 0.6×	288 1.4×	139 0.9×	85 0.7×	68	917
Vangélis Th. Paschos France	18	589 1.0×	451 1.0×	174 0.9×	99 0.6×	145 1.2×	119	1.1k
Y. Bartal Israel	13	354 0.6×	654 1.4×	93 0.5×	72 0.5×	179 1.5×	24	938
Fǎnicǎ Gavril Israel	17	1.2k 2.0×	575 1.2×	138 0.7×	183 1.2×	121 1.0×	35	1.5k
Jayme L. Szwarcfiter Brazil	20	1.2k 2.0×	398 0.9×	128 0.6×	204 1.3×	153 1.3×	187	1.7k
Joseph Cheriyan Canada	18	678 1.1×	603 1.3×	75 0.4×	187 1.2×	100 0.8×	62	917
Ton Kloks Netherlands	21	1.4k 2.3×	526 1.1×	94 0.5×	151 1.0×	173 1.4×	61	1.6k
Yijie Han United States	16	291 0.5×	341 0.7×	159 0.8×	118 0.8×	183 1.5×	63	741
Hervé Brönnimann United States	19	301 0.5×	373 0.8×	524 2.6×	141 0.9×	205 1.7×	56	1.1k

Countries citing papers authored by Satish Rao

Since Specialization

Citations

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

Fields of papers citing papers by Satish Rao

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Satish Rao

This figure shows the co-authorship network connecting the top 25 collaborators of Satish Rao. A scholar is included among the top collaborators of Satish Rao 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 Satish Rao. Satish Rao is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Fakcharoenphol, Jittat, Chris Harrelson, & Satish Rao. (2007). The k -traveling repairmen problem. ACM Transactions on Algorithms. 3(4). 40–40. 45 indexed citations

Amir, Eyal, Robert Krauthgamer, & Satish Rao. (2003). Constant factor approximation of vertex-cuts in planar graphs. 2 indexed citations

Rao, Satish, Torsten Suel, Thanasis Tsantilas, & Mark W. Goudreau. (2002). Efficient communication using total-exchange. 1. 544–550. 4 indexed citations

Rao, Satish & Andréa W. Richa. (1998). New approximation techniques for some ordering problems. Symposium on Discrete Algorithms. 211–218. 41 indexed citations

Leiserson, Charles E., Satish Rao, & Sivan Toledo. (1997). Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. Journal of Computer and System Sciences. 54(2). 332–344. 11 indexed citations

Even, Guy, Joseph Naor, Satish Rao, & Baruch Schieber. (1995). Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).. 62–71. 5 indexed citations

Klein, Philip N., Satish Rao, Ajit Agrawal, & R. Ravi. (1995). An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. COMBINATORICA. 15(2). 187–202. 27 indexed citations

Plotkin, Serge, Satish Rao, & Warren D. Smith. (1994). Shallow excluded minors and improved graph decompositions. Symposium on Discrete Algorithms. 462–470. 53 indexed citations

Klein, Philip N., Satish Rao, Monika Rauch, & Sairam Subramanian. (1994). Faster shortest-path algorithms for planar graphs. 27–37. 55 indexed citations

10.

Leiserson, Charles E., Satish Rao, & Sivan Toledo. (1993). Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract). 44(1). 704–713. 4 indexed citations

11.

Lang, Kevin & Satish Rao. (1993). Finding near-optimal cuts: an empirical evaluation. Symposium on Discrete Algorithms. 212–221. 27 indexed citations

12.

Klein, Philip N., Serge Plotkin, Satish Rao, & Éva Tardos. (1993). Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows. 7 indexed citations

13.

Kaklamanis, Christos, Danny Kriz̧anc, & Satish Rao. (1993). Hot-potato routing on processor arrays. 273–282. 32 indexed citations

14.

Klein, Philip N., Serge Plotkin, & Satish Rao. (1993). Excluded minors, network decomposition, and multicommodity flow. 682–690. 145 indexed citations

15.

Rao, Satish. (1992). Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract). 229–240. 4 indexed citations

16.

Klein, Philip N., Ajit Agrawal, R. Ravi, & Satish Rao. (1991). An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications. 1 indexed citations

17.

Kaklamanis, Christos, Anna R. Karlin, Frank Thomson Leighton, et al.. (1990). Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract). 285–296. 2 indexed citations

18.

Leighton, Frank Thomson, et al.. (1989). Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract). 227–240. 6 indexed citations

19.

Leighton, Frank Thomson, Bruce M. Maggs, & Satish Rao. (1988). Universal Packet Routing Algorithms (Extended Abstract). 256–269. 3 indexed citations

20.

Rao, Satish. (1987). Finding near optimal separators in planar graphs. 36. 225–237. 22 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