Balaji Raghavachari

70 papers A* 11B 10Misc 1Journal 33Unranked 7

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