Satish Rao
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 2%
- Computer Graphics and Computer-Aided Design top 1%
- Electrical and Electronic Engineering
- Artificial Intelligence top 10%
- Co-authors
- Philip N. KleinSerge PlotkinSairam SubramanianMonika HenzingerChris HarrelsonGuy EvenJoseph NaorBaruch Schieber
- Topics
- Advanced Graph Theory Research (19 papers)Complexity and Algorithms in Graphs (16 papers)Optimization and Search Problems (10 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignComputational Theory and MathematicsComputer Networks and Communications
- Partner nations
- United StatesCanadaGermany
In The Last Decade
Satish Rao
30 papers receiving 876 citations
Peers
Comparison fields: 5 of 67
- Computational Theory and Mathematics 607
- Computer Networks and Communications 466
- Computer Graphics and Computer-Aided Design 199
- Electrical and Electronic Engineering 156
- Artificial Intelligence 122
Countries citing papers authored by Satish Rao
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | 45 | |
| 3 | 2 | |
| 4 | 4 | |
| 5 | 41 | |
| 6 | 11 | |
| 7 | Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). | 5 |
| 8 | 27 | |
| 9 | 53 | |
| 10 | 55 | |
| 11 | 27 | |
| 12 | 4 | |
| 13 | Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows | 7 |
| 14 | 32 | |
| 15 | Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) | 4 |
| 16 | An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications | 1 |
| 17 | Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) | 2 |
| 18 | Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) | 6 |
| 19 | Universal Packet Routing Algorithms (Extended Abstract) | 3 |
| 20 | 22 |
About Satish Rao
Satish Rao is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Networks and Communications, having authored 30 papers that have together received 956 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (16 papers) and Optimization and Search Problems (10 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (199 citations), Computational Theory and Mathematics (607 citations) and Computer Networks and Communications (466 citations). Satish Rao has collaborated with scholars based in United States, Canada and Germany. Frequent co-authors include Philip N. Klein, Serge Plotkin, Sairam Subramanian, Monika Henzinger, Chris Harrelson, Guy Even, Joseph Naor, Baruch Schieber, Kirsten Hildrum and Andréa W. Richa. Their work appears in journals such as SIAM Journal on Computing, Journal of Computer and System Sciences and Journal of Algorithms.
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.