Aravind Srinivasan

12.0k total citations · 2 hit papers
175 papers, 6.8k citations indexed

About

Aravind Srinivasan is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Aravind Srinivasan has authored 175 papers receiving a total of 6.8k indexed citations (citations by other indexed papers that have themselves been cited), including 87 papers in Computer Networks and Communications, 82 papers in Computational Theory and Mathematics and 32 papers in Artificial Intelligence. Recurrent topics in Aravind Srinivasan's work include Complexity and Algorithms in Graphs (72 papers), Optimization and Search Problems (46 papers) and Advanced Graph Theory Research (39 papers). Aravind Srinivasan is often cited by papers focused on Complexity and Algorithms in Graphs (72 papers), Optimization and Search Problems (46 papers) and Advanced Graph Theory Research (39 papers). Aravind Srinivasan collaborates with scholars based in United States, Singapore and Germany. Aravind Srinivasan's 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 and has published in prestigious journals such as Nature, Proceedings of the National Academy of Sciences and Environmental Science & Technology.

In The Last Decade

Aravind Srinivasan

165 papers receiving 6.3k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Modelling disease outbreaks in realistic urban social networks

2004 1.4k citations Aravind Srinivasan et al. profile →
Mobile Data Offloading through Opportunistic Communications and Social Participation

2011 369 citations Aravind Srinivasan et al. profile →

Peers

Aravind Srinivasan

CNC

CTM

AI

EEE

MS

Madhav Marathe United States

Stephanie Forrest United States

Naren Ramakrishnan United States

Ming Cao Netherlands

Wagner Meira Brazil

Chris Watkins United Kingdom

Reuven Cohen Israel

Patrizio Colaneri Italy

Milind Tambe United States

Devavrat Shah United States

Madhav Marathe United States

Aravind Srinivasan

2.9k ×0.9

CNC

951 ×0.6

CTM

759 ×0.7

AI

1.2k ×1.1

EEE

2.7k ×3.9

MS

Citations per year, relative to Aravind Srinivasan Aravind Srinivasan (= 1×) peers Madhav Marathe

Countries citing papers authored by Aravind Srinivasan

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

20 of 20 papers shown

1.

Dickerson, John P., et al.. (2024). Barter Exchange with Shared Item Valuations. arXiv (Cornell University). 199–210.

2.

Dickerson, John P., et al.. (2019). Online Resource Allocation with Matching Constraints. 1681–1689. 3 indexed citations

3.

Dickerson, John P., Karthik Abinav Sankararaman, Aravind Srinivasan, & Pan Xu. (2018). Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. Adaptive Agents and Multi-Agents Systems. 318–326. 20 indexed citations

4.

Harris, David G. & Aravind Srinivasan. (2017). Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. ACM Transactions on Algorithms. 13(3). 1–40. 5 indexed citations

5.

Byrka, Jarosław, et al.. (2017). An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization. ACM Transactions on Algorithms. 13(2). 1–31. 34 indexed citations

6.

Srinivasan, Aravind, et al.. (2017). . Theory of Computing. 13(1). 1–41. 4 indexed citations

7.

Bansal, Nikhil, Nitish Korula, Viswanath Nagarajan, & Aravind Srinivasan. (2012). . Theory of Computing. 8(1). 533–565. 15 indexed citations

8.

Gupta, Anupam & Aravind Srinivasan. (2006). . Theory of Computing. 2(1). 53–64. 5 indexed citations

9.

Dubhashi, Devdatt, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, & Aravind Srinivasan. (2005). Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. Journal of Computer and System Sciences. 71(4). 467–479. 41 indexed citations

10.

Gandhi, Rajiv, Eran Halperin, Samir Khuller, Guy Kortsarz, & Aravind Srinivasan. (2003). An improved approximation algorithm for vertex cover with hard capacities (extended abstract). Lecture notes in computer science. 2719. 164–175. 2 indexed citations

11.

Gasarch, William, Evan Golub, & Aravind Srinivasan. (2003). When does a random Robin Hood win?. Theoretical Computer Science. 304(1-3). 477–484.

12.

Li, Yi, Philip M. Long, & Aravind Srinivasan. (2001). Improved Bounds on the Sample Complexity of Learning. Journal of Computer and System Sciences. 62(3). 516–527. 89 indexed citations

13.

Li, Yi, Philip M. Long, & Aravind Srinivasan. (2000). Improved bounds on the sample complexity of learning. Symposium on Discrete Algorithms. 309–318. 6 indexed citations

14.

Chari, Suresh, Pankaj Rohatgi, & Aravind Srinivasan. (2000). Improved Algorithms via Approximations of Probability Distributions. Journal of Computer and System Sciences. 61(1). 81–107. 15 indexed citations

15.

Alon, Noga & Aravind Srinivasan. (1996). Improved Parallel Approximation of a Class of Integer Programming Programming Problems. International Colloquium on Automata, Languages and Programming. 562–573. 2 indexed citations

16.

Srinivasan, Aravind. (1996). An extension of the Lovász local lemma, and its applications to integer programming. Symposium on Discrete Algorithms. 6–15. 29 indexed citations

17.

Schmidt, Jeanette P., Alan Siegel, & Aravind Srinivasan. (1993). Chernoff-Hoeffding bounds for applications with limited independence. Symposium on Discrete Algorithms. 331–340. 26 indexed citations

18.

Panconesi, Alessandro & Aravind Srinivasan. (1992). Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).. 251–262.

19.

Srinivasan, Aravind & C. Pandu Rangan. (1991). Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1). 1–21. 3 indexed citations

20.

Rangan, C. Pandu, et al.. (1991). On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2). 218–224. 17 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