| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengli Yuan, Balaji Raghavachari, Ankitkumar Patel |
Finding Maximum Reliable Path in Mesh Networks under Multiple Failures. |
ICCCN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengli Yuan, Balaji Raghavachari, Lei Chen |
A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability. |
GLOBECOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Degree-bounded minimum spanning trees. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Improved approximation algorithms for the single-sink buy-at-bulk network design problems. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi |
DOMINE: a database of protein domain interactions. |
Nucleic Acids Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari |
Graph Connectivity. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Approximating the k-traveling repairman problem with repairtimes. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Prabhakar Gubbala, Balaji Raghavachari |
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial Optimization, Connectivity, Graph and network algorithms |
| 1 | Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi |
Load-balanced agent activation for value-added network services. |
Computer Communications |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, Spanning trees, minimum spanning trees |
| 1 | Prabhakar Gubbala, Balaji Raghavachari |
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Survivable network design: the capacitated minimum spanning network problem. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi |
Approximation algorithms for finding low-degree subgraphs. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Minimum Latency Tours and the k-Traveling Repairmen Problem. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Prabhakar Gubbala, Balaji Raghavachari |
Finding k-Connected Subgraphs with Minimum Average Weight. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari |
Degree-bounded minimum spanning trees. |
CCCG |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç |
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. |
SAC |
2004 |
DBLP DOI BibTeX RDF |
NAK-suppression, feedback implosion, graph theory, system design, reliable multicast |
| 1 | Raja Jothi, Balaji Raghavachari |
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç |
Load balancing for reliable multicast. |
Communications, Internet, and Information Technology |
2004 |
DBLP BibTeX RDF |
|
| 1 | Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan |
A 5/4-approximation algorithm for minimum 2-edge-connectivity. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Balancing Minimum Spanning and Shortest Path Trees |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Low-Degree Spanning Trees of Small Weight |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
On Strongly Connected Digraphs with Bounded Cycle Length |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Designing Multi-Commodity Flow Trees |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Approximating the Minimum Equivalent Digraph |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Samir Khuller, Balaji Raghavachari |
Algorithms for Capacitated Vehicle Routing. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Radha Krishnan, Balaji Raghavachari |
The Directed Minimum-Degree Spanning Tree Problem. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari |
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Balaji Raghavachari, Jeyakesavan Veerasamy |
A 3/2-Approximation Algorithm for the Mixed Postman Problem. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Balaji Raghavachari, Jeyakesavan Veerasamy |
Approximation Algorithms for the Asymmetric Postman Problem. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
Windy postman problem, asymmetric postman problem, approximation algorithms, linear programming, combinatorial optimization, Chinese postman problem |
| 1 | Samir Khuller, Balaji Raghavachari, An Zhu |
A Uniform Framework for Approximating Weighted Connectivity Problems. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Balaji Raghavachari, Jeyakesavan Veerasamy |
Approximation Algorithms for the Mixed Postman Problem. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Balaji Raghavachari |
The Finite Capacity Dial-A-Ride Problem. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
dial-a-ride, stacker crane, probabilistic approximation of metric spaces, algorithm, routing, approximation, capacity, vehicle, delivery, tree metric |
| 1 | Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari |
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Samir Khuller, Balaji Raghavachari |
Algorithms for Capacitated Vehicle Routing. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari |
Graph and Network Algorithms. |
The Computer Science and Engineering Handbook |
1997 |
DBLP BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari |
Improved Approximation Algorithms for Uniform Connectivity Problems. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Balaji Raghavachari |
Parallel Edge Coloring Approximation. |
Parallel Processing Letters |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari |
Graph and Network Algorithms. |
ACM Comput. Surv. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
On Strongly Connected Digraphs with Bounded Cycle Length. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld |
Landmarks in Graphs. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Low-Degree Spanning Trees of Small Weight. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Balancing Minimum Spanning Trees and Shortest-Path Trees. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Balaji Raghavachari |
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Approximating the Minimum Equivalent Digraph. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari |
Improved approximation algorithms for uniform connectivity problems. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Designing Multi-Commodity Flow Trees. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Balaji Raghavachari |
Approximating the Minimum-Degree Steiner Tree to within One of Optimal. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Approximating the Minimum Equivalent Diagraph. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Low degree spanning trees of small weight. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Balancing Minimum Spanning and Shortest Path Trees. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Designing Multi-Commodity Flow Trees. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Balaji Raghavachari |
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. |
SODA |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Ravi, Balaji Raghavachari, Philip N. Klein |
Approximation Through Local Optimality: Designing Networks with Small Degree. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")