| Year |
Citation |
Score |
| 2011 |
Yellaboina S, Tasneem A, Zaykin DV, Raghavachari B, Jothi R. DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Nucleic Acids Research. 39: D730-5. PMID 21113022 DOI: 10.1093/Nar/Gkq1229 |
0.566 |
|
| 2010 |
Yuan S, Raghavachari B, Patel A. Finding maximum reliable path in mesh networks under multiple failures Proceedings - International Conference On Computer Communications and Networks, Icccn. DOI: 10.1109/ICCCN.2010.5560082 |
0.361 |
|
| 2010 |
Yuan S, Raghavachari B, Chen L. A threat-aware routing algorithm for maximum physical-layer path survivability Globecom - Ieee Global Telecommunications Conference. DOI: 10.1109/GLOCOM.2010.5683786 |
0.447 |
|
| 2009 |
Jothi R, Raghavachari B. Improved approximation algorithms for the single-sink buy-at-bulk network design problems Journal of Discrete Algorithms. 7: 249-255. DOI: 10.1016/J.Jda.2008.12.003 |
0.716 |
|
| 2009 |
Jothi R, Raghavachari B. Degree-bounded minimum spanning trees Discrete Applied Mathematics. 157: 960-970. DOI: 10.1016/J.Dam.2008.03.037 |
0.717 |
|
| 2008 |
Raghavachari B, Tasneem A, Przytycka TM, Jothi R. DOMINE: a database of protein domain interactions. Nucleic Acids Research. 36: D656-61. PMID 17913741 DOI: 10.1093/Nar/Gkm761 |
0.567 |
|
| 2007 |
Jothi R, Raghavachari B. Approximating the k-traveling repairman problem with repairtimes Journal of Discrete Algorithms. 5: 293-303. DOI: 10.1016/J.Jda.2006.03.023 |
0.722 |
|
| 2007 |
Gubbala P, Raghavachari B. A 4/3-approximation algorithm for minimum 3-edge-connectivity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4619: 39-51. |
0.778 |
|
| 2006 |
Gong C, Sarac K, Daescu O, Raghavachari B, Jothi R. Load-balanced agent activation for value-added network services Computer Communications. 29: 1905-1916. DOI: 10.1016/J.Comcom.2005.10.035 |
0.652 |
|
| 2005 |
Wang J, Vokkarane VM, Jothi R, Qi X, Raghavachari B, Jue JP. Dual-homing protection in IP-over-WDM networks Journal of Lightwave Technology. 23: 3111-3124. DOI: 10.1109/Jlt.2005.856321 |
0.625 |
|
| 2005 |
Gubbala P, Raghavachari B. Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem Lecture Notes in Computer Science. 3509: 422-436. |
0.789 |
|
| 2004 |
Jothi R, Raghavachari B. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3142: 805-818. DOI: 10.1145/1103963.1103967 |
0.747 |
|
| 2004 |
Jothi R, Raghavachari B. Survivable network design: The capacitated minimum spanning network problem Information Processing Letters. 91: 183-190. DOI: 10.1016/J.Ipl.2004.04.007 |
0.732 |
|
| 2004 |
Klein PN, Krishnan R, Raghavachari B, Ravi R. Approximation algorithms for finding low-degree subgraphs Networks. 44: 203-215. DOI: 10.1002/Net.20031 |
0.531 |
|
| 2004 |
Daescu O, Jothi R, Raghavachari B, Sarac K. Optimal placement of NAK-suppressing agents for reliable multicast: A partial deployment case Proceedings of the Acm Symposium On Applied Computing. 1: 334-338. |
0.652 |
|
| 2004 |
Gong C, Daescu O, Jothi R, Raghavachari B, Sarac K. Load balancing for reliable multicast 433-121 Proceedings of the Third Iasted International Conference On Communications, Internet, and Information Technology. 86-91. |
0.672 |
|
| 2004 |
Jothi R, Raghavachari B. Minimum latency tours and the k-traveling repairmen problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2976: 423-433. |
0.712 |
|
| 2004 |
Vokkarane VM, Wang J, Qi X, Jothi R, Raghavachari B, Jue JP. Dynamic dual-homing protection in WDM mesh networks Ieee International Conference On Communications. 3: 1644-1648. |
0.597 |
|
| 2004 |
Gubbala P, Raghavachari B. Finding k-connected subgraphs with minimum average weight Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2976: 212-221. |
0.759 |
|
| 2003 |
Jothi R, Raghavachari B, Varadarajan S. A 5/4-approximation algorithm for minimum 2-edge-connectivity Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 725-734. |
0.673 |
|
| 2003 |
Jothi R, Raghavachari B. Design of local access networks Proceedings of the Iasted International Conference On Parallel and Distributed Computing and Systems. 15: 883-888. |
0.707 |
|
| 2002 |
Charikar M, Khuller S, Raghavachari B. Algorithms for capacitated vehicle routing Siam Journal On Computing. 31: 665-682. DOI: 10.1137/S0097539701392056 |
0.471 |
|
| 2001 |
Krishnan R, Raghavachari B. The directed minimum-degree spanning tree problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2245: 232-243. |
0.488 |
|
| 2000 |
Guttmann-Beck N, Hassin R, Khuller S, Raghavachari B. Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem Algorithmica. 28: 422-437. DOI: 10.1007/S004530010045 |
0.511 |
|
| 1999 |
Raghavachari B, Veerasamy J. A 3/2-Approximation algorithm for the mixed postman problem Siam Journal On Discrete Mathematics. 12: 425-433. DOI: 10.1137/S0895480197331454 |
0.558 |
|
| 1998 |
Guttmann-Beck N, Hassin R, Khuller S, Raghavachari B. Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Extended Abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1530: 6-17. DOI: 10.1007/978-3-540-49382-2_2 |
0.423 |
|
| 1998 |
Raghavachari B, Veerasamy J. Approximation algorithms for the mixed postman problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1412: 169-179. DOI: 10.1007/3-540-69346-7_13 |
0.483 |
|
| 1997 |
Harary F, Raghavachari B. The E-mail gossip number and the connected domination number Applied Mathematics Letters. 10: 15-17. DOI: 10.1016/S0893-9659(97)00052-9 |
0.384 |
|
| 1997 |
Fekete SP, Khuller S, Klemmstein M, Raghavachari B, Young N. A network-flow technique for finding low-weight bounded-degree spanning trees Journal of Algorithms. 24: 310-324. DOI: 10.1006/Jagm.1997.0862 |
0.56 |
|
| 1996 |
Khuller S, Raghavachari B. Graph and network algorithms Acm Computing Surveys. 28: 43-45. DOI: 10.1145/234313.234334 |
0.524 |
|
| 1996 |
Khuller S, Raghavachari B, Young N. Low-Degree Spanning Trees of Small Weight Siam Journal On Computing. 25: 355-368. DOI: 10.1137/S0097539794264585 |
0.447 |
|
| 1996 |
Khuller S, Raghavachari B, Rosenfeld A. Landmarks in graphs Discrete Applied Mathematics. 70: 217-229. DOI: 10.1016/0166-218X(95)00106-2 |
0.413 |
|
| 1996 |
Khuller S, Raghavachari B, Young N. On strongly connected digraphs with bounded cycle length Discrete Applied Mathematics. 69: 281-289. DOI: 10.1016/0166-218X(95)00105-Z |
0.526 |
|
| 1996 |
Khuller S, Raghavachari B. Improved Approximation Algorithms for Uniform Connectivity Problems Journal of Algorithms. 21: 434-450. DOI: 10.1006/Jagm.1996.0052 |
0.606 |
|
| 1996 |
Khuller S, Raghavachari B, Young N. Low-degree spanning trees of small weight Siam Journal On Computing. 25: 355-368. |
0.346 |
|
| 1996 |
Khuller S, Raghavachari B, Young N. On strongly connected digraphs with bounded cycle length Discrete Applied Mathematics. 69: 281-289. |
0.415 |
|
| 1996 |
Fekete SP, Khuller S, Klemmstein M, Raghavachari B, Young N. A network-flow technique for finding low-weight bounded-degree spanning trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1084: 105-117. |
0.481 |
|
| 1996 |
Khuller S, Raghavachari B. Graph and network algorithms Acm Computing Surveys. 28: 42-45. |
0.404 |
|
| 1995 |
Khuller S, Raghavachari B, Young N. Approximating the Minimum Equivalent Digraph Siam Journal On Computing. 24: 859-872. DOI: 10.1137/S0097539793256685 |
0.612 |
|
| 1995 |
Khuller S, Raghavachari B, Young N. Balancing minimum spanning trees and shortest-path trees Algorithmica. 14: 305-321. DOI: 10.1007/Bf01294129 |
0.464 |
|
| 1995 |
Furer M, Raghavachari B. An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs Journal of Algorithms. 18: 203-220. DOI: 10.1006/Jagm.1995.1007 |
0.419 |
|
| 1994 |
Kao M, Fürer M, He X, Raghavachari B. Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs Siam Journal On Discrete Mathematics. 7: 632-646. DOI: 10.1137/S0895480191221453 |
0.384 |
|
| 1994 |
Khuller S, Raghavachari B, Young N. Designing multi-commodity flow trees Information Processing Letters. 50: 49-55. DOI: 10.1016/0020-0190(94)90044-2 |
0.505 |
|
| 1994 |
Furer M, Raghavachari B. Approximating the Minimum-Degree Steiner Tree to within One of Optimal Journal of Algorithms. 17: 409-423. DOI: 10.1006/jagm.1994.1042 |
0.478 |
|
| Show low-probability matches. |