Balaji Raghavachari

Most-cited papers

Landmarks in Graphs
S. Khuller, Balaji Raghavachari, A. Rosenfeld
1996Discrete Applied Mathematics841 citations Open access
Semantic Scholar
Balancing minimum spanning trees and shortest-path trees
S. Khuller, Balaji Raghavachari, N. Young
1995Algorithmica211 citations
Semantic Scholar
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
Martin Fürer, Balaji Raghavachari
1994J. Algorithms208 citations
Semantic Scholar
DOMINE: a comprehensive collection of known and predicted domain-domain interactions
Sailu Yellaboina, A. Tasneem, D. Zaykin, Balaji Raghavachari +1 more
2010Nucleic Acids Res.192 citations Open access
Semantic Scholar
Balancing minimum spanning and shortest path trees
S. Khuller, Balaji Raghavachari, N. Young
1993ACM-SIAM Symposium on Discrete Algorithms177 citations
Semantic Scholar
Improved approximation algorithms for uniform connectivity problems
S. Khuller, Balaji Raghavachari
1995Symposium on the Theory of Computing175 citations Open access
Semantic Scholar
Approximating the minimum degree spanning tree to within one from the optimal degree
Martin Fürer, Balaji Raghavachari
1992ACM-SIAM Symposium on Discrete Algorithms150 citations
Semantic Scholar
DOMINE: a database of protein domain interactions
Balaji Raghavachari, A. Tasneem, T. Przytycka, R. Jothi
2007Nucleic Acids Res.146 citations Open access
Semantic Scholar
Approximating the minimum equivalent digraph
S. Khuller, Balaji Raghavachari, N. Young
1994ACM-SIAM Symposium on Discrete Algorithms99 citations Open access
Semantic Scholar
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem
Nili Guttmann-Beck, Refael Hassin, S. Khuller, Balaji Raghavachari
1998Algorithmica94 citations
Semantic Scholar
Localization in graphs
S. Khuller, Balaji Raghavachari, A. Rosenfeld
199484 citations
Semantic Scholar
Low degree spanning trees of small weight
S. Khuller, Balaji Raghavachari, N. Young
1994Symposium on the Theory of Computing84 citations Open access
Semantic Scholar
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
R. Jothi, Balaji Raghavachari
2004TALG72 citations
Semantic Scholar
The finite capacity dial-a-ride problem
M. Charikar, Balaji Raghavachari
1998Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)67 citations
Semantic Scholar
A 5/4-approximation algorithm for minimum 2-edge-connectivity
R. Jothi, Balaji Raghavachari, S. Varadarajan
2003ACM-SIAM Symposium on Discrete Algorithms66 citations
Semantic Scholar
Algorithms for capacitated vehicle routing
M. Charikar, S. Khuller, Balaji Raghavachari
1998Symposium on the Theory of Computing62 citations Open access
Semantic Scholar
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
S. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari +1 more
1996J. Algorithms51 citations Open access
Semantic Scholar
On Strongly Connected Digraphs with Bounded Cycle Length
S. Khuller, Balaji Raghavachari, N. Young
1996Discrete Applied Mathematics44 citations Open access
Semantic Scholar
Approximating the k-traveling repairman problem with repairtimes
R. Jothi, Balaji Raghavachari
2007J. Discrete Algorithms40 citations Open access
Semantic Scholar
Graph and network algorithms
S. Khuller, Balaji Raghavachari
1996CSUR38 citations Open access
Semantic Scholar
Chaining Multiple-Alignment Blocks
Zheng Zhang, Balaji Raghavachari, R. Hardison, W. Miller
1994J. Comput. Biol.34 citations
Semantic Scholar
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
R. Jothi, Balaji Raghavachari
2004J. Discrete Algorithms33 citations Open access
Semantic Scholar
Degree-bounded minimum spanning trees
R. Jothi, Balaji Raghavachari
2009Canadian Conference on Computational Geometry31 citations Open access
Semantic Scholar
A 3/2-Approximation Algorithm for the Mixed Postman Problem
Balaji Raghavachari, J. Veerasamy
1999SIAM Journal on Discrete Mathematics31 citations
Semantic Scholar
The Directed Minimum-Degree Spanning Tree Problem
R. Krishnan, Balaji Raghavachari
2001Foundations of Software Technology and Theoretical Computer Science27 citations
Semantic Scholar
A uniform framework for approximating weighted connectivity problems
S. Khuller, Balaji Raghavachari, An Zhu
1999ACM-SIAM Symposium on Discrete Algorithms27 citations
Semantic Scholar
Designing Multi-Commodity Flow Trees
S. Khuller, Balaji Raghavachari, N. Young
1993Information Processing Letters26 citations Open access
Semantic Scholar
Algorithms for finding low degree structures
Balaji Raghavachari
199624 citations
Semantic Scholar
Approximation algorithms for finding low‐degree subgraphs
P. Klein, R. Krishnan, Balaji Raghavachari, R. Ravi
2004Networks22 citations
Semantic Scholar
Approximation Through Local Optimality: Designing Networks with Small Degree
R. Ravi, Balaji Raghavachari, P. Klein
1992Foundations of Software Technology and Theoretical Computer Science22 citations
Semantic Scholar
Graph Connectivity
S. Khuller, Balaji Raghavachari
2008Encyclopedia of Algorithms21 citations
Semantic Scholar
Minimum Latency Tours and the k-Traveling Repairmen Problem
R. Jothi, Balaji Raghavachari
2004Latin American Symposium on Theoretical Informatics17 citations
Semantic Scholar
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
Martin Fürer, Xin He, M. Kao, Balaji Raghavachari
1992ACM Symposium on Parallelism in Algorithms and Architectures15 citations Open access
Semantic Scholar
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
M. Kao, M. Fürer, Xin He, Balaji Raghavachari
1994SIAM Journal on Discrete Mathematics14 citations
Semantic Scholar
Basic Graph Algorithms
S. Khuller, Balaji Raghavachari
2010Algorithms and Theory of Computation Handbook13 citations
Semantic Scholar
Constructing Aligned Sequence Blocks
W. Miller, M. Boguski, Balaji Raghavachari, Zheng Zhang +1 more
1994J. Comput. Biol.13 citations
Semantic Scholar
Approximation Algorithms for the Mixed Postman Problem
Balaji Raghavachari, J. Veerasamy
1998Conference on Integer Programming and Combinatorial Optimization12 citations
Semantic Scholar
Approximation algorithms for the asymmetric postman problem
Balaji Raghavachari, J. Veerasamy
1999ACM-SIAM Symposium on Discrete Algorithms11 citations
Semantic Scholar
Greedy Methods
S. Khuller, Balaji Raghavachari, N. Young
2007Handbook of Approximation Algorithms and Metaheuristics10 citations
Semantic Scholar
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
Prabhakar Gubbala, Balaji Raghavachari
2005Conference on Integer Programming and Combinatorial Optimization9 citations
Semantic Scholar
Survivable network design: the capacitated minimum spanning network problem
R. Jothi, Balaji Raghavachari
2004Information Processing Letters9 citations
Semantic Scholar
Approximation algorithms for postman problems
J. Veerasamy, Balaji Raghavachari
19998 citations
Semantic Scholar
Parallel Edge Coloring Approximation
Martin Fürer, Balaji Raghavachari
1996Parallel Processing Letters8 citations
Semantic Scholar
Problems in graph connectivity
Balaji Raghavachari, Prabhakar Gubbala
20066 citations
Semantic Scholar
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case
O. Daescu, R. Jothi, Balaji Raghavachari, Kamil Saraç
2004ACM Symposium on Applied Computing6 citations
Semantic Scholar
Design of local access networks
R. Jothi, Balaji Raghavachari
20035 citations
Semantic Scholar
The e-mail gossip number and the connected domination number☆
F. Harary, Balaji Raghavachari
19975 citations Open access
Semantic Scholar
Advanced Combinatorial Algorithms
S. Khuller, Balaji Raghavachari
2010Algorithms and Theory of Computation Handbook3 citations
Semantic Scholar
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
Prabhakar Gubbala, Balaji Raghavachari
2007Workshop on Algorithms and Data Structures3 citations
Semantic Scholar
Maintaining directed reachability with few edges
S. Khuller, Balaji Raghavachari, N. Young
19933 citations
Semantic Scholar