Balaji Raghavachari

2.7k total citations · 1 hit paper
46 papers, 1.5k citations indexed

About

Balaji Raghavachari is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Balaji Raghavachari has authored 46 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 15 papers in Computer Networks and Communications and 7 papers in Electrical and Electronic Engineering. Recurrent topics in Balaji Raghavachari's work include Complexity and Algorithms in Graphs (22 papers), Advanced Graph Theory Research (20 papers) and Optimization and Search Problems (7 papers). Balaji Raghavachari is often cited by papers focused on Complexity and Algorithms in Graphs (22 papers), Advanced Graph Theory Research (20 papers) and Optimization and Search Problems (7 papers). Balaji Raghavachari collaborates with scholars based in United States, Hong Kong and Israel. Balaji Raghavachari's co-authors include Samir Khuller, Azriel Rosenfeld, Raja Jothi, Martin Fürer, Neal E. Young, Sailu Yellaboina, Dmitri V. Zaykin, Moses Charikar, Teresa M. Przytycka and Refael Hassin and has published in prestigious journals such as Nucleic Acids Research, ACM Computing Surveys and Journal of Lightwave Technology.

In The Last Decade

Balaji Raghavachari

44 papers receiving 1.4k 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.

Landmarks in graphs

1996 511 citations Samir Khuller, Balaji Raghavachari et al. Discrete Applied Mathematics profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Balaji Raghavachari United States	17	926	395	305	257	173	46	1.5k
Jayme L. Szwarcfiter Brazil	20	1.2k 1.3×	398 1.0×	204 0.7×	46 0.2×	328 1.9×	187	1.7k
Fǎnicǎ Gavril Israel	17	1.2k 1.3×	575 1.5×	183 0.6×	62 0.2×	200 1.2×	35	1.5k
Daniel Lokshtanov Norway	22	2.0k 2.2×	772 2.0×	174 0.6×	146 0.6×	120 0.7×	159	2.4k
Saket Saurabh India	24	2.3k 2.5×	938 2.4×	212 0.7×	171 0.7×	115 0.7×	258	2.8k
Douglas B. West United States	25	1.8k 2.0×	582 1.5×	387 1.3×	68 0.3×	528 3.1×	231	2.3k
K. Thulasiraman United States	17	227 0.2×	579 1.5×	500 1.6×	37 0.1×	82 0.5×	101	1.1k
Paweł Winter Denmark	14	455 0.5×	621 1.6×	753 2.5×	75 0.3×	26 0.2×	41	1.4k
Elias Dahlhaus Germany	13	618 0.7×	287 0.7×	80 0.3×	65 0.3×	58 0.3×	45	937
Jiřı́ Sgall Czechia	23	450 0.5×	863 2.2×	133 0.4×	140 0.5×	23 0.1×	86	1.6k
Mohammad R. Salavatipour Canada	18	597 0.6×	458 1.2×	238 0.8×	42 0.2×	18 0.1×	60	1.0k

Countries citing papers authored by Balaji Raghavachari

Since Specialization

Citations

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

Fields of papers citing papers by Balaji Raghavachari

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Balaji Raghavachari

This figure shows the co-authorship network connecting the top 25 collaborators of Balaji Raghavachari. A scholar is included among the top collaborators of Balaji Raghavachari 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 Balaji Raghavachari. Balaji Raghavachari 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.

Raghavachari, Balaji, Bhadrachalam Chitturi, & Dong‐Hyun Kim. (2013). Efficient Gene Prioritization. 1 indexed citations

2.

Yellaboina, Sailu, et al.. (2010). DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Nucleic Acids Research. 39(suppl_1). D730–D735. 145 indexed citations

3.

Jothi, Raja & Balaji Raghavachari. (2009). Improved approximation algorithms for the single-sink buy-at-bulk network design problems. Journal of Discrete Algorithms. 7(2). 249–255. 4 indexed citations

4.

Raghavachari, Balaji, et al.. (2007). DOMINE: a database of protein domain interactions. Nucleic Acids Research. 36(suppl_1). D656–D661. 99 indexed citations

5.

Jothi, Raja & Balaji Raghavachari. (2006). Approximating the k-traveling repairman problem with repairtimes. Journal of Discrete Algorithms. 5(2). 293–303. 25 indexed citations

6.

Jothi, Raja & Balaji Raghavachari. (2004). Degree-bounded minimum spanning trees.. Canadian Conference on Computational Geometry. 192–195. 4 indexed citations

7.

Klein, Philip N., et al.. (2004). Approximation algorithms for finding low‐degree subgraphs. Networks. 44(3). 203–215. 14 indexed citations

8.

Jothi, Raja, et al.. (2003). A 5/4-approximation algorithm for minimum 2-edge-connectivity. Symposium on Discrete Algorithms. 725–734. 13 indexed citations

9.

Charikar, Moses & Balaji Raghavachari. (2001). The Finite Capacity Dial-A-Ride Problem. 1 indexed citations

10.

Khuller, Samir, Balaji Raghavachari, & An Zhu. (1999). A uniform framework for approximating weighted connectivity problems. Symposium on Discrete Algorithms. 937–938. 15 indexed citations

11.

Raghavachari, Balaji, et al.. (1999). Approximation algorithms for the asymmetric postman problem. Symposium on Discrete Algorithms. 734–741. 1 indexed citations

12.

Raghavachari, Balaji, et al.. (1999). Approximation algorithms for postman problems. 4 indexed citations

13.

Charikar, Moses, Samir Khuller, & Balaji Raghavachari. (1998). Algorithms for capacitated vehicle routing. 349–358. 7 indexed citations

14.

Raghavachari, Balaji. (1996). Algorithms for finding low degree structures. 266–295. 11 indexed citations

15.

Khuller, Samir, Balaji Raghavachari, & Azriel Rosenfeld. (1996). Landmarks in graphs. Discrete Applied Mathematics. 70(3). 217–229. 511 indexed citations breakdown →

16.

Khuller, Samir & Balaji Raghavachari. (1996). Improved Approximation Algorithms for Uniform Connectivity Problems. Journal of Algorithms. 21(2). 434–450. 83 indexed citations

17.

Khuller, Samir, Balaji Raghavachari, & Neal E. Young. (1995). Approximating the Minimum Equivalent Digraph. SIAM Journal on Computing. 24(4). 859–872. 39 indexed citations

18.

Miller, Webb, Mark S. Boguski, Balaji Raghavachari, Zheng Zhang, & Ross C. Hardison. (1994). Constructing Aligned Sequence Blocks. Journal of Computational Biology. 1(1). 51–64. 7 indexed citations

19.

Khuller, Samir, Balaji Raghavachari, & Neal E. Young. (1993). Balancing minimum spanning and shortest path trees. Symposium on Discrete Algorithms. 243–250. 25 indexed citations

20.

Fürer, Martin & Balaji Raghavachari. (1992). Approximating the minimum degree spanning tree to within one from the optimal degree. Symposium on Discrete Algorithms. 317–324. 69 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