Balaji Raghavachari

Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin, Balaji Raghavachari, Raja Jothi: DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Nucleic Acids Research 39(Database-Issue): 730-735 (2011)

Shengli Yuan, Balaji Raghavachari, Lei Chen: A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability. GLOBECOM 2010: 1-5

Shengli Yuan, Balaji Raghavachari, Ankitkumar Patel: Finding Maximum Reliable Path in Mesh Networks under Multiple Failures. ICCCN 2010: 1-6

Raja Jothi, Balaji Raghavachari: Degree-bounded minimum spanning trees. Discrete Applied Mathematics 157(5): 960-970 (2009)

Raja Jothi, Balaji Raghavachari: Improved approximation algorithms for the single-sink buy-at-bulk network design problems. J. Discrete Algorithms 7(2): 249-255 (2009)

Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi: DOMINE: a database of protein domain interactions. Nucleic Acids Research 36(Database-Issue): 656-661 (2008)

Samir Khuller, Balaji Raghavachari: Graph Connectivity. Encyclopedia of Algorithms 2008

Raja Jothi, Balaji Raghavachari: Approximating the k-traveling repairman problem with repairtimes. J. Discrete Algorithms 5(2): 293-303 (2007)

Prabhakar Gubbala, Balaji Raghavachari: A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. WADS 2007: 39-51

Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi: Load-balanced agent activation for value-added network services. Computer Communications 29(11): 1905-1916 (2006)

Raja Jothi, Balaji Raghavachari: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Transactions on Algorithms 1(2): 265-282 (2005)

Prabhakar Gubbala, Balaji Raghavachari: Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. IPCO 2005: 422-436

Raja Jothi, Balaji Raghavachari: Survivable network design: the capacitated minimum spanning network problem. Inf. Process. Lett. 91(4): 183-190 (2004)

Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi: Approximation algorithms for finding low-degree subgraphs. Networks 44(3): 203-215 (2004)

Raja Jothi, Balaji Raghavachari: Degree-bounded minimum spanning trees. CCCG 2004: 192-195

Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç: Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91

Raja Jothi, Balaji Raghavachari: Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. ICALP 2004: 805-818

Vinod Vokkarane, Jianping Wang, Xiangtong Qi, Raja Jothi, Balaji Raghavachari, Jason P. Jue: Dynamic dual-homing protection in WDM mesh networks. ICC 2004: 1644-1648

Prabhakar Gubbala, Balaji Raghavachari: Finding k-Connected Subgraphs with Minimum Average Weight. LATIN 2004: 212-221

Raja Jothi, Balaji Raghavachari: Minimum Latency Tours and the k-Traveling Repairmen Problem. LATIN 2004: 423-433

Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç: Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. SAC 2004: 334-338

Raja Jothi, Balaji Raghavachari: Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. SWAT 2004: 336-348

Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan: A 5/4-approximation algorithm for minimum 2-edge-connectivity. SODA 2003: 725-734

Samir Khuller, Balaji Raghavachari, Neal E. Young: On Strongly Connected Digraphs with Bounded Cycle Length. CoRR cs.DS/0205011 (2002)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Digraph. CoRR cs.DS/0205040 (2002)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Low-Degree Spanning Trees of Small Weight. CoRR cs.DS/0205043 (2002)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning and Shortest Path Trees. CoRR cs.DS/0205045 (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 cs.DS/0205050 (2002)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. CoRR cs.DS/0205077 (2002)

Moses Charikar, Samir Khuller, Balaji Raghavachari: Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31(3): 665-682 (2001)

Radha Krishnan, Balaji Raghavachari: The Directed Minimum-Degree Spanning Tree Problem. FSTTCS 2001: 232-243

Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari: Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica 28(4): 422-437 (2000)

Balaji Raghavachari, Jeyakesavan Veerasamy: A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM J. Discrete Math. 12(4): 425-433 (1999)

Balaji Raghavachari, Jeyakesavan Veerasamy: Approximation Algorithms for the Asymmetric Postman Problem. SODA 1999: 734-741

Samir Khuller, Balaji Raghavachari, An Zhu: A Uniform Framework for Approximating Weighted Connectivity Problems. SODA 1999: 937-938

Moses Charikar, Balaji Raghavachari: The Finite Capacity Dial-A-Ride Problem. FOCS 1998: 458-467

Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari: Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. FSTTCS 1998: 6-17

Balaji Raghavachari, Jeyakesavan Veerasamy: Approximation Algorithms for the Mixed Postman Problem. IPCO 1998: 169-179

Moses Charikar, Samir Khuller, Balaji Raghavachari: Algorithms for Capacitated Vehicle Routing. STOC 1998: 349-358

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): 310-324 (1997)

Samir Khuller, Balaji Raghavachari: Graph and Network Algorithms. The Computer Science and Engineering Handbook 1997: 203-225

Samir Khuller, Balaji Raghavachari: Graph and Network Algorithms. ACM Comput. Surv. 28(1): 43-45 (1996)

Samir Khuller, Balaji Raghavachari, Neal E. Young: On Strongly Connected Digraphs with Bounded Cycle Length. Discrete Applied Mathematics 69(3): 281-289 (1996)

Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld: Landmarks in Graphs. Discrete Applied Mathematics 70(3): 217-229 (1996)

Samir Khuller, Balaji Raghavachari: Improved Approximation Algorithms for Uniform Connectivity Problems. J. Algorithms 21(2): 434-450 (1996)

Martin Fürer, Balaji Raghavachari: Parallel Edge Coloring Approximation. Parallel Processing Letters 6(3): 321-329 (1996)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25(2): 355-368 (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: 105-117

Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14(4): 305-321 (1995)

Martin Fürer, Balaji Raghavachari: An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms 18(2): 203-220 (1995)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24(4): 859-872 (1995)

Samir Khuller, Balaji Raghavachari: Improved approximation algorithms for uniform connectivity problems. STOC 1995: 1-10

Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50(1): 49-55 (1994)

Martin Fürer, Balaji Raghavachari: Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms 17(3): 409-423 (1994)

Webb Miller, Mark Boguski, Balaji Raghavachari, Zheng Zhang, Ross C. Hardison: Constructing Aligned Sequence Blocks. Journal of Computational Biology 1(1): 51-64 (1994)

Zheng Zhang, Balaji Raghavachari, Ross C. Hardison, Webb Miller: Chaining Multiple-Alignment Blocks. Journal of Computational Biology 1(3): 217-226 (1994)

Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari: Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discrete Math. 7(4): 632-646 (1994)

Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Diagraph. SODA 1994: 177-186

Samir Khuller, Balaji Raghavachari, Neal E. Young: Low degree spanning trees of small weight. STOC 1994: 412-421

Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning and Shortest Path Trees. SODA 1993: 243-250

Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. WADS 1993: 433-441

R. Ravi, Balaji Raghavachari, Philip N. Klein: Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS 1992: 279-290

Martin Fürer, Balaji Raghavachari: Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA 1992: 317-324

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: 410-419