Balaji Raghavachari Vis

*	2009
58	EE	Raja Jothi, Balaji Raghavachari: Degree-bounded minimum spanning trees. Discrete Applied Mathematics 157(5): 960-970 (2009)
57	EE	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)
	2008
56	EE	Samir Khuller, Balaji Raghavachari: Graph Connectivity. Encyclopedia of Algorithms 2008
55	EE	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)
	2007
54	EE	Prabhakar Gubbala, Balaji Raghavachari: A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. WADS 2007: 39-51
53	EE	Raja Jothi, Balaji Raghavachari: Approximating the k-traveling repairman problem with repairtimes. J. Discrete Algorithms 5(2): 293-303 (2007)
	2006
52	EE	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)
	2005
51	EE	Prabhakar Gubbala, Balaji Raghavachari: Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. IPCO 2005: 422-436
50	EE	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)
	2004
49	EE	Raja Jothi, Balaji Raghavachari: Degree-bounded minimum spanning trees. CCCG 2004: 192-195
48		Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç: Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91
47	EE	Raja Jothi, Balaji Raghavachari: Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. ICALP 2004: 805-818
46	EE	Prabhakar Gubbala, Balaji Raghavachari: Finding k-Connected Subgraphs with Minimum Average Weight. LATIN 2004: 212-221
45	EE	Raja Jothi, Balaji Raghavachari: Minimum Latency Tours and the k-Traveling Repairmen Problem. LATIN 2004: 423-433
44	EE	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
43	EE	Raja Jothi, Balaji Raghavachari: Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. SWAT 2004: 336-348
42	EE	Raja Jothi, Balaji Raghavachari: Survivable network design: the capacitated minimum spanning network problem. Inf. Process. Lett. 91(4): 183-190 (2004)
41	EE	Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi: Approximation algorithms for finding low-degree subgraphs. Networks 44(3): 203-215 (2004)
	2003
40	EE	Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan: A 5/4-approximation algorithm for minimum 2-edge-connectivity. SODA 2003: 725-734
	2002
39	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: On Strongly Connected Digraphs with Bounded Cycle Length CoRR cs.DS/0205011: (2002)
38	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Digraph CoRR cs.DS/0205040: (2002)
37	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: Low-Degree Spanning Trees of Small Weight CoRR cs.DS/0205043: (2002)
36	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning and Shortest Path Trees CoRR cs.DS/0205045: (2002)
35	EE	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)
34	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees CoRR cs.DS/0205077: (2002)
	2001
33	EE	Radha Krishnan, Balaji Raghavachari: The Directed Minimum-Degree Spanning Tree Problem. FSTTCS 2001: 232-243
32	EE	Moses Charikar, Samir Khuller, Balaji Raghavachari: Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31(3): 665-682 (2001)
	2000
31	EE	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)
	1999
30	EE	Balaji Raghavachari, Jeyakesavan Veerasamy: Approximation Algorithms for the Asymmetric Postman Problem. SODA 1999: 734-741
29	EE	Samir Khuller, Balaji Raghavachari, An Zhu: A Uniform Framework for Approximating Weighted Connectivity Problems. SODA 1999: 937-938
28	EE	Balaji Raghavachari, Jeyakesavan Veerasamy: A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM J. Discrete Math. 12(4): 425-433 (1999)
	1998
27	EE	Moses Charikar, Balaji Raghavachari: The Finite Capacity Dial-A-Ride Problem. FOCS 1998: 458-467
26	EE	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
25	EE	Balaji Raghavachari, Jeyakesavan Veerasamy: Approximation Algorithms for the Mixed Postman Problem. IPCO 1998: 169-179
24	EE	Moses Charikar, Samir Khuller, Balaji Raghavachari: Algorithms for Capacitated Vehicle Routing. STOC 1998: 349-358
	1997
23		Samir Khuller, Balaji Raghavachari: Graph and Network Algorithms. The Computer Science and Engineering Handbook 1997: 203-225
22		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)
	1996
21	EE	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
20		Samir Khuller, Balaji Raghavachari: Graph and Network Algorithms. ACM Comput. Surv. 28(1): 43-45 (1996)
19	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: On Strongly Connected Digraphs with Bounded Cycle Length. Discrete Applied Mathematics 69(3): 281-289 (1996)
18	EE	Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld: Landmarks in Graphs. Discrete Applied Mathematics 70(3): 217-229 (1996)
17		Samir Khuller, Balaji Raghavachari: Improved Approximation Algorithms for Uniform Connectivity Problems. J. Algorithms 21(2): 434-450 (1996)
16	EE	Martin Fürer, Balaji Raghavachari: Parallel Edge Coloring Approximation. Parallel Processing Letters 6(3): 321-329 (1996)
15		Samir Khuller, Balaji Raghavachari, Neal E. Young: Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25(2): 355-368 (1996)
	1995
14	EE	Samir Khuller, Balaji Raghavachari: Improved approximation algorithms for uniform connectivity problems. STOC 1995: 1-10
13		Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14(4): 305-321 (1995)
12		Martin Fürer, Balaji Raghavachari: An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms 18(2): 203-220 (1995)
11		Samir Khuller, Balaji Raghavachari, Michael R. Fellows: Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24(4): 859-872 (1995)
	1994
10		Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Diagraph. SODA 1994: 177-186
9	EE	Samir Khuller, Balaji Raghavachari, Neal E. Young: Low degree spanning trees of small weight. STOC 1994: 412-421
8		Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50(1): 49-55 (1994)
7		Martin Fürer, Balaji Raghavachari: Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms 17(3): 409-423 (1994)
6	EE	Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari: Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs. SIAM J. Discrete Math. 7(4): 632-646 (1994)
	1993
5		Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning and Shortest Path Trees. SODA 1993: 243-250
4		Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. WADS 1993: 433-441
	1992
3	EE	R. Ravi, Balaji Raghavachari, Philip N. Klein: Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS 1992: 279-290
2	EE	Martin Fürer, Balaji Raghavachari: Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA 1992: 317-324
1	EE	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

Coauthor Index

1	Moses Charikar	[24] [27] [32]
2	Ovidiu Daescu	[44] [48] [52]
3	Sándor P. Fekete	[21] [22] [35]
4	Michael R. Fellows (Mike Fellows)	[11]
5	Martin Fürer	[1] [2] [6] [7] [12] [16]
6	Chao Gong	[48] [52]
7	Prabhakar Gubbala	[46] [51] [54]
8	Nili Guttmann-Beck	[26] [31]
9	Refael Hassin	[26] [31]
10	Xin He	[1] [6]
11	Raja Jothi	[40] [42] [43] [44] [45] [47] [48] [49] [50] [52] [53] [55] [57] [58]
12	Ming-Yang Kao	[1] [6]
13	Samir Khuller	[4] [5] [8] [9] [10] [11] [13] [14] [15] [17] [18] [19] [20] [21] [22] [23] [24] [26] [29] [31] [32] [34] [35] [36] [37] [38] [39] [56]
14	Philip N. Klein	[3] [41]
15	Monika Klemmstein	[21] [22] [35]
16	Radha Krishnan	[33] [41]
17	Teresa M. Przytycka	[55]
18	R. Ravi	[3] [41]
19	Azriel Rosenfeld	[18]
20	Kamil Saraç	[44] [48] [52]
21	Asba Tasneem	[55]
22	Subramanian Varadarajan	[40]
23	Jeyakesavan Veerasamy	[25] [28] [30]
24	Neal E. Young	[4] [5] [8] [9] [10] [13] [15] [19] [21] [22] [34] [35] [36] [37] [38] [39]
25	An Zhu	[29]

Colors in the list of coauthors