Balaji Raghavachari

Publication Activity (10 Years)

Years Active: 1992-2011
Publications (10 Years): 0

Publications

Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin, Balaji Raghavachari, Raja Jothi
DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Nucleic Acids Res. 39 (Database-Issue) (2011)
Shengli Yuan, Balaji Raghavachari, Ankitkumar Patel
Finding Maximum Reliable Path in Mesh Networks under Multiple Failures. ICCCN (2010)
Shengli Yuan, Balaji Raghavachari, Lei Chen
A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability. GLOBECOM (2010)
Raja Jothi, Balaji Raghavachari
Improved approximation algorithms for the single-sink buy-at-bulk network design problems. J. Discrete Algorithms 7 (2) (2009)
Raja Jothi, Balaji Raghavachari
Degree-bounded minimum spanning trees. Discret. Appl. Math. 157 (5) (2009)
Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi
DOMINE: a database of protein domain interactions. Nucleic Acids Res. 36 (Database-Issue) (2008)
Raja Jothi, Balaji Raghavachari
Approximating the k-traveling repairman problem with repairtimes. J. Discrete Algorithms 5 (2) (2007)
Prabhakar Gubbala, Balaji Raghavachari
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. WADS (2007)
Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi
Load-balanced agent activation for value-added network services. Comput. Commun. 29 (11) (2006)
Prabhakar Gubbala, Balaji Raghavachari
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. IPCO (2005)
Raja Jothi, Balaji Raghavachari
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms 1 (2) (2005)
Raja Jothi, Balaji Raghavachari
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. SWAT (2004)
Prabhakar Gubbala, Balaji Raghavachari
Finding k-Connected Subgraphs with Minimum Average Weight. LATIN (2004)
Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. SAC (2004)
Raja Jothi, Balaji Raghavachari
Survivable network design: the capacitated minimum spanning network problem. Inf. Process. Lett. 91 (4) (2004)
Raja Jothi, Balaji Raghavachari
Minimum Latency Tours and the k-Traveling Repairmen Problem. LATIN (2004)
Vinod Vokkarane, Jianping Wang, Xiangtong Qi, Raja Jothi, Balaji Raghavachari, Jason P. Jue
Dynamic dual-homing protection in WDM mesh networks. ICC (2004)
Raja Jothi, Balaji Raghavachari
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. ICALP (2004)
Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi
Approximation algorithms for finding low-degree subgraphs. Networks 44 (3) (2004)
Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
Load balancing for reliable multicast. Communications, Internet, and Information Technology (2004)
Raja Jothi, Balaji Raghavachari
Degree-bounded minimum spanning trees. CCCG (2004)
Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan
A 5/4-approximation algorithm for minimum 2-edge-connectivity. SODA (2003)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Balancing Minimum Spanning and Shortest Path Trees CoRR (2002)
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees CoRR (2002)
Samir Khuller, Balaji Raghavachari, Neal E. Young
On Strongly Connected Digraphs with Bounded Cycle Length CoRR (2002)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Approximating the Minimum Equivalent Digraph CoRR (2002)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Low-Degree Spanning Trees of Small Weight CoRR (2002)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Designing Multi-Commodity Flow Trees CoRR (2002)
Radha Krishnan, Balaji Raghavachari
The Directed Minimum-Degree Spanning Tree Problem. FSTTCS (2001)
Moses Charikar, Samir Khuller, Balaji Raghavachari
Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31 (3) (2001)
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica 28 (4) (2000)
Balaji Raghavachari, Jeyakesavan Veerasamy
A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM J. Discret. Math. 12 (4) (1999)
Balaji Raghavachari, Jeyakesavan Veerasamy
Approximation Algorithms for the Asymmetric Postman Problem. SODA (1999)
Samir Khuller, Balaji Raghavachari, An Zhu
A Uniform Framework for Approximating Weighted Connectivity Problems. SODA (1999)
Moses Charikar, Samir Khuller, Balaji Raghavachari
Algorithms for Capacitated Vehicle Routing. STOC (1998)
Balaji Raghavachari, Jeyakesavan Veerasamy
Approximation Algorithms for the Mixed Postman Problem. IPCO (1998)
Moses Charikar, Balaji Raghavachari
The Finite Capacity Dial-A-Ride Problem. FOCS (1998)
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. FSTTCS (1998)
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. J. Algorithms 24 (2) (1997)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25 (2) (1996)
Martin Fürer, Balaji Raghavachari
Parallel Edge Coloring Approximation. Parallel Process. Lett. 6 (3) (1996)
Samir Khuller, Balaji Raghavachari
Graph and Network Algorithms. ACM Comput. Surv. 28 (1) (1996)
Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld
Landmarks in Graphs. Discret. Appl. Math. 70 (3) (1996)
Samir Khuller, Balaji Raghavachari, Neal E. Young
On Strongly Connected Digraphs with Bounded Cycle Length. Discret. Appl. Math. 69 (3) (1996)
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. IPCO (1996)
Samir Khuller, Balaji Raghavachari
Improved Approximation Algorithms for Uniform Connectivity Problems. J. Algorithms 21 (2) (1996)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14 (4) (1995)
Samir Khuller, Balaji Raghavachari
Improved approximation algorithms for uniform connectivity problems. STOC (1995)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24 (4) (1995)
Martin Fürer, Balaji Raghavachari
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms 18 (2) (1995)
Martin Fürer, Balaji Raghavachari
Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms 17 (3) (1994)
Zheng Zhang, Balaji Raghavachari, Ross C. Hardison, Webb Miller
Chaining Multiple-Alignment Blocks. J. Comput. Biol. 1 (3) (1994)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Approximating the Minimum Equivalent Diagraph. SODA (1994)
Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discret. Math. 7 (4) (1994)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Low degree spanning trees of small weight. STOC (1994)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50 (1) (1994)
Webb Miller, Mark Boguski, Balaji Raghavachari, Zheng Zhang, Ross C. Hardison
Constructing Aligned Sequence Blocks. J. Comput. Biol. 1 (1) (1994)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Balancing Minimum Spanning and Shortest Path Trees. SODA (1993)
Samir Khuller, Balaji Raghavachari, Neal E. Young
Designing Multi-Commodity Flow Trees. WADS (1993)
R. Ravi, Balaji Raghavachari, Philip N. Klein
Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS (1992)
Martin Fürer, Balaji Raghavachari
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA (1992)
Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SPAA (1992)