Aravind Srinivasan
- Computer Networks and Communications top 0.2%
- Computational Theory and Mathematics top 0.2%
- Artificial Intelligence top 1%
- Electrical and Electronic Engineering top 5%
- Modeling and Simulation top 0.2%
- Co-authors
- Madhav MaratheV. S. Anil KumarStephen EubankZoltán ToroczkaiNan WangHasan GüçlüAlessandro PanconesiBo Han
- Topics
- Complexity and Algorithms in Graphs (72 papers)Optimization and Search Problems (46 papers)Advanced Graph Theory Research (39 papers)
- Cited by
- Modeling and SimulationComputer Networks and CommunicationsComputational Theory and Mathematics
- Partner nations
- United StatesSingaporeGermany
In The Last Decade
Aravind Srinivasan
165 papers receiving 6.3k citations
Hit Papers
Peers
Comparison fields: 5 of 165
- Computer Networks and Communications 3.2k
- Computational Theory and Mathematics 1.5k
- Artificial Intelligence 1.1k
- Electrical and Electronic Engineering 1.0k
- Modeling and Simulation 709
Countries citing papers authored by Aravind Srinivasan
This map shows the geographic impact of Aravind Srinivasan'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 Aravind Srinivasan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aravind Srinivasan more than expected).
Fields of papers citing papers by Aravind Srinivasan
This network shows the impact of papers produced by Aravind Srinivasan. 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 Aravind Srinivasan. The network helps show where Aravind Srinivasan may publish in the future.
Co-authorship network of co-authors of Aravind Srinivasan
This figure shows the co-authorship network connecting the top 25 collaborators of Aravind Srinivasan. A scholar is included among the top collaborators of Aravind Srinivasan 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 Aravind Srinivasan. Aravind Srinivasan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 3 | |
| 3 | 20 | |
| 4 | 5 | |
| 5 | 34 | |
| 6 | 4 | |
| 7 | 15 | |
| 8 | 5 | |
| 9 | 41 | |
| 10 | An improved approximation algorithm for vertex cover with hard capacities (extended abstract) | 2 |
| 11 | 0 | |
| 12 | 89 | |
| 13 | 6 | |
| 14 | 15 | |
| 15 | Improved Parallel Approximation of a Class of Integer Programming Programming Problems | 2 |
| 16 | 29 | |
| 17 | 26 | |
| 18 | Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). | 0 |
| 19 | 3 | |
| 20 | 17 |
About Aravind Srinivasan
Aravind Srinivasan is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 175 papers that have together received 6.8k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (72 papers), Optimization and Search Problems (46 papers) and Advanced Graph Theory Research (39 papers). The work is most often cited by research in Modeling and Simulation (709 citations), Computer Networks and Communications (3.2k citations) and Computational Theory and Mathematics (1.5k citations). Aravind Srinivasan has collaborated with scholars based in United States, Singapore and Germany. Frequent co-authors include Madhav Marathe, V. S. Anil Kumar, Stephen Eubank, Zoltán Toroczkai, Nan Wang, Hasan Güçlü, Alessandro Panconesi, Bo Han, Srinivasan Parthasarathy and Bobby Bhattacharjee. Their work appears in journals such as Nature, Proceedings of the National Academy of Sciences and Environmental Science & Technology.
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.