Rajmohan Rajaraman

5.6k citations
83 papers · 3.3k indexed · h-index 29
Topics
Complexity and Algorithms in Graphs (24 papers)Optimization and Search Problems (24 papers)Advanced Graph Theory Research (15 papers)
Partner nations
United StatesIndiaCanada

In The Last Decade

Rajmohan Rajaraman

82 papers receiving 3.0k citations

Peers

Rajmohan Rajaraman
Comparison fields: 5 of 107
  • Computer Networks and Communications 2.6k
  • Electrical and Electronic Engineering 518
  • Computational Theory and Mathematics 431
  • Industrial and Manufacturing Engineering 248
  • Information Systems 227
Replace Ulrich Pferschy with:
Ulrich Pferschy Austria
S. S. Ravi United States
Naveen Garg India
Chaitanya Swamy Canada
Kamesh Munagala United States
Baruch Schieber United States
Jens Vygen Germany
Lyle A. McGeoch United States
Bernhard Körte Germany
Francesco Maffioli Italy
Rajmohan Rajaraman relative to Ulrich Pferschy Austria Ulrich Pferschy's profile →
Citations per field
00.5×1.5×2.2×
Ulrich Pferschy · 1×
Citations per year

Countries citing papers authored by Rajmohan Rajaraman

Since Specialization
Citations

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

Fields of papers citing papers by Rajmohan Rajaraman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rajmohan Rajaraman

This figure shows the co-authorship network connecting the top 25 collaborators of Rajmohan Rajaraman. A scholar is included among the top collaborators of Rajmohan Rajaraman 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 Rajmohan Rajaraman. Rajmohan Rajaraman 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
#WorkIndexed citations
1 1
2 5
3 47
4
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
0
5 10
6 113
7 7
8 79
9 11
10
Hybrid Push−Pull Query Processing for Sensor Networks
28
11 91
12 59
13 4
14 48
15 118
16 31
17 267
18 92
19 8
20 69

About Rajmohan Rajaraman

Rajmohan Rajaraman is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Industrial and Manufacturing Engineering, having authored 83 papers that have together received 3.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (24 papers), Optimization and Search Problems (24 papers) and Advanced Graph Theory Research (15 papers). The work is most often cited by research in Computer Networks and Communications (2.6k citations), Computational Theory and Mathematics (431 citations) and Industrial and Manufacturing Engineering (248 citations). Rajmohan Rajaraman has collaborated with scholars based in United States, India and Canada. Frequent co-authors include C. Greg Plaxton, Andréa W. Richa, Madhukar Korupolu, Guevara Noubir, Lujun Jia, Torsten Suel, S. Muthukrishnan, Johannes Gehrke, Chaitanya Swamy and Bishal Thapa. Their work appears in journals such as PLoS ONE, Ophthalmology and Journal of the ACM.

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

Rankless by CCL
2026