Balaji Raghavachari - Publications

Affiliations: 
University of Texas at Dallas, Richardson, TX, United States 
Area:
Computer Science

40 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

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  1
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  1
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  1
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  1
2009 Jothi R, Raghavachari B. Degree-bounded minimum spanning trees Discrete Applied Mathematics. 157: 960-970. DOI: 10.1016/J.Dam.2008.03.037  1
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  1
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  1
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.  1
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  1
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  1
2005 Bansal A, Patel K, Gupta G, Raghavachari B, Harris ED, Staves JC. Towards intelligent services: A case study in chemical emergency response Proceedings - 2005 Ieee International Conference On Web Services, Icws 2005. 2005: 751-758. DOI: 10.1109/ICWS.2005.122  1
2005 Gubbala P, Raghavachari B. Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem Lecture Notes in Computer Science. 3509: 422-436.  1
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  1
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  1
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  1
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.  1
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.  1
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.  1
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.  1
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.  1
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.  1
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.  1
2002 Charikar M, Khuller S, Raghavachari B. Algorithms for capacitated vehicle routing Siam Journal On Computing. 31: 665-682. DOI: 10.1137/S0097539701392056  1
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.  1
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  1
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  1
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  1
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  1
1996 Khuller S, Raghavachari B, Rosenfeld A. Landmarks in graphs Discrete Applied Mathematics. 70: 217-229. DOI: 10.1016/0166-218X(95)00106-2  1
1996 Khuller S, Raghavachari B. Improved Approximation Algorithms for Uniform Connectivity Problems Journal of Algorithms. 21: 434-450. DOI: 10.1006/Jagm.1996.0052  1
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.  1
1996 Khuller S, Raghavachari B. Graph and network algorithms Acm Computing Surveys. 28: 42-45.  1
1996 Khuller S, Raghavachari B, Young N. Low-degree spanning trees of small weight Siam Journal On Computing. 25: 355-368.  1
1996 Khuller S, Raghavachari B, Young N. On strongly connected digraphs with bounded cycle length Discrete Applied Mathematics. 69: 281-289.  1
1995 Khuller S, Raghavachari B, Young N. Balancing minimum spanning trees and shortest-path trees Algorithmica. 14: 305-321. DOI: 10.1007/Bf01294129  1
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  1
1994 Zhang Z, Raghavachari B, Hardison RC, Miller W. Chaining multiple-alignment blocks. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 1: 217-26. PMID 8790466 DOI: 10.1089/Cmb.1994.1.217  1
1994 Miller W, Boguski M, Raghavachari B, Zhang Z, Hardison RC. Constructing aligned sequence blocks. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 1: 51-64. PMID 8790453 DOI: 10.1089/Cmb.1994.1.51  1
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  1
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  1
Show low-probability matches.