Vijaya Ramachandran

4.1k total citations
85 papers, 1.8k citations indexed

About

Vijaya Ramachandran is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Vijaya Ramachandran has authored 85 papers receiving a total of 1.8k indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computer Networks and Communications, 41 papers in Computational Theory and Mathematics and 29 papers in Artificial Intelligence. Recurrent topics in Vijaya Ramachandran's work include Complexity and Algorithms in Graphs (38 papers), Parallel Computing and Optimization Techniques (27 papers) and Interconnection Networks and Systems (25 papers). Vijaya Ramachandran is often cited by papers focused on Complexity and Algorithms in Graphs (38 papers), Parallel Computing and Optimization Techniques (27 papers) and Interconnection Networks and Systems (25 papers). Vijaya Ramachandran collaborates with scholars based in United States, Germany and Canada. Vijaya Ramachandran's co-authors include Seth Pettie, Rezaul Chowdhury, Richard M. Karp, Phillip B. Gibbons, Yossi Matias, Gary L. Miller, Michael A. Kozuch, Shimin Chen, John H. Reif and Arkady Kanevsky and has published in prestigious journals such as Nature, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Vijaya Ramachandran

83 papers receiving 1.7k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Vijaya Ramachandran United States 25 1.0k 641 609 578 179 85 1.8k
R. K. Shyamasundar India 14 740 0.7× 433 0.7× 334 0.5× 479 0.8× 218 1.2× 132 1.8k
Fabrizio Luccio Italy 19 559 0.5× 297 0.5× 580 1.0× 586 1.0× 201 1.1× 102 1.7k
Shlomo Moran Israel 25 1.4k 1.4× 306 0.5× 1.1k 1.8× 1.0k 1.7× 196 1.1× 117 3.1k
Burkhard Monien Germany 25 926 0.9× 260 0.4× 723 1.2× 365 0.6× 100 0.6× 118 1.9k
Friedhelm Meyer auf der Heide Germany 20 725 0.7× 151 0.2× 406 0.7× 377 0.7× 171 1.0× 116 1.3k
Martin Charles Golumbic Israel 29 834 0.8× 212 0.3× 1.9k 3.1× 375 0.6× 74 0.4× 100 2.6k
Sampath Kannan United States 23 540 0.5× 123 0.2× 745 1.2× 961 1.7× 153 0.9× 67 1.8k
Jürg Nievergelt Switzerland 12 505 0.5× 154 0.2× 213 0.3× 493 0.9× 169 0.9× 54 1.2k
Ittai Abraham Israel 28 1.7k 1.7× 148 0.2× 402 0.7× 632 1.1× 131 0.7× 90 2.5k
Daniel S. Hirschberg United States 14 351 0.3× 165 0.3× 316 0.5× 694 1.2× 178 1.0× 28 1.2k

Countries citing papers authored by Vijaya Ramachandran

Since Specialization
Citations

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

Fields of papers citing papers by Vijaya Ramachandran

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Vijaya Ramachandran

This figure shows the co-authorship network connecting the top 25 collaborators of Vijaya Ramachandran. A scholar is included among the top collaborators of Vijaya Ramachandran 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 Vijaya Ramachandran. Vijaya Ramachandran 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
1.
Ramachandran, Vijaya, et al.. (2024). Computing Minimum Weight Cycle in the CONGEST Model. 182–193.
2.
Ramachandran, Vijaya, et al.. (2018). Fine-grained complexity for sparse graphs. 239–252. 6 indexed citations
3.
Cole, Richard & Vijaya Ramachandran. (2017). Resource Oblivious Sorting on Multicores. arXiv (Cornell University). 3(4). 1–31. 8 indexed citations
4.
Cole, Richard & Vijaya Ramachandran. (2012). Efficient Resource Oblivious Algorithms for Multicores with False Sharing. 201–214. 9 indexed citations
5.
Ramachandran, Vijaya. (2011). Brave New World: A Literature Review of Emerging Donors and the Changing Nature of Foreign Assistanc- Working Paper 273. RePEc: Research Papers in Economics. 16 indexed citations
6.
Chowdhury, Rezaul, et al.. (2010). Oblivious algorithms for multicores and network of processors. Padua Research Archive (University of Padova). 1–12. 48 indexed citations
7.
Chen, Shimin, Michael A. Kozuch, Phillip B. Gibbons, et al.. (2009). Flexible Hardware Acceleration for Instruction-Grain Lifeguards. IEEE Micro. 29(1). 62–72. 10 indexed citations
8.
Blelloch, Guy E., Rezaul Chowdhury, Phillip B. Gibbons, et al.. (2008). Provably good multicore cache performance for divide-and-conquer algorithms. Symposium on Discrete Algorithms. 501–510. 65 indexed citations
9.
Chowdhury, Rezaul & Vijaya Ramachandran. (2008). Cache-efficient dynamic programming algorithms for multicores. 207–216. 57 indexed citations
10.
Chowdhury, Rezaul & Vijaya Ramachandran. (2005). External-memory exact and approximate all-pairs shortest-paths in undirected graphs. Symposium on Discrete Algorithms. 735–744. 9 indexed citations
11.
Ganapathy, Ganeshkumar, Vijaya Ramachandran, & Tandy Warnow. (2004). On contract-and-refine transformations between phylogenetic trees. Symposium on Discrete Algorithms. 900–909. 8 indexed citations
12.
Pettie, Seth & Vijaya Ramachandran. (2002). Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. Symposium on Discrete Algorithms. 713–722. 15 indexed citations
13.
Pettie, Seth & Vijaya Ramachandran. (2002). Computing shortest paths with comparisons and additions. Symposium on Discrete Algorithms. 267–276. 29 indexed citations
14.
Ramachandran, Vijaya, et al.. (1999). Emulations between QSM, BSP, and LogP: a framework for general-purpose parallel algorithm design. Symposium on Discrete Algorithms. 957–958. 8 indexed citations
15.
Hsu, Tsan‐sheng & Vijaya Ramachandran. (1996). Efficient massively parallel implementation of some combinatorial algorithms. Theoretical Computer Science. 162(2). 297–322. 7 indexed citations
16.
Gibbons, Phillip B., Yossi Matias, & Vijaya Ramachandran. (1994). The QRQW PRAM: accounting for contention in parallel algorithms. Symposium on Discrete Algorithms. 638–648. 42 indexed citations
17.
Ramachandran, Vijaya. (1993). Efficient parallel graph algorithms. Cambridge University Press eBooks. 67–76.
18.
Ramachandran, Vijaya. (1993). Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms. 56 indexed citations
19.
Kelsen, Pierre, et al.. (1992). Computing minimal spanning subgraphs in linear time. Max Planck Institute for Plasma Physics. 146–156. 5 indexed citations
20.
Kelsen, Pierre & Vijaya Ramachandran. (1991). On finding minimal 2-connected subgraphs. Symposium on Discrete Algorithms. 178–187. 7 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

Rankless by CCL
2026