Copyright Notice: Most of these
papers are published, the copyright has been transferred to the respective
publishers. Therefore, the papers cannot be duplicated for commercial purposes
without the written permission from the respective publishers.
-
DOMINE: a comprehensive collection of known and predicted domain-domain interactions,
Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin, Balaji Raghavachari, and Raja Jothi,
Nucleic Acids Research, Volume 39 (Database issue), pages 730-735, 2011.
-
A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability,
Shengli Yuan, Balaji Raghavachari, and Lei Chen,
Proceedings, IEEE Globecom 2010, December 5-10, Miami, FL.
-
Finding Maximum Reliable Path in Mesh Networks under Multiple Failures,
Shengli Yuan, Balaji Raghavachari, and Ankitkumar Patel,
Proceedings, 19th International Conference on Computer Communications and Networks (ICCCN 2010), pages 1-6, August 2-5, 2010.
-
Degree-bounded minimum spanning trees,
Raja Jothi and Balaji Raghavachari,
Discrete Applied Mathematics, Volume 157, Number 5, pages 960-970, 2009.
-
Improved approximation algorithms for the single-sink buy-at-bulk network design problem,
Raja Jothi and Balaji Raghavachari,
Journal of Discrete Algorithms, Volume 7, Number 2, pages 249-255, 2009.
-
DOMINE: A database of protein domain interactions,
B. Raghavachari, A. Tasneem, T.M. Przytycka, and R. Jothi,
Nucleic Acids Research, Vol 36 (Database Issue), D656-661, 2008.
[PDF]
[Text]
[Database Website]
-
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity,
P. Gubbala, and B. Raghavachari,
Proceedings of the Workshop on Algorithms and Data Structures (WADS),
Halifax, Canada, August 2007, pages 39-51.
-
Approximating the k-traveling repairman problem with repairtimes,
Raja Jothi and Balaji Raghavachari
Journal of Discrete Algorithms, 5(2): 293-303 (2007), Elsevier Press.
-
Greedy Methods,
Samir Khuller, Balaji Raghavachari, and Neal Young,
Chapter 4 in ``Approximation Algorithms and Metaheuristics,'' Teofilo
F. Gonzalez (ed.), Chapman & Hill/CRC, 2007.
-
Load balanced agent activation for value added network services,
C. Gong, K. Sarac, O. Daescu, B. Raghavachari, and R. Jothi,
Computer Communications, Volume 29, Number 11, pages 1905-1916, Elsevier Press, July 2006.
-
Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem,
Prabhakar Gubbala and Balaji Raghavachari,
Proceedings of the Eleventh Conference on Integer Programming and
Combinatorial Optimization (IPCO), Berlin, Jun 8-10, 2005, pages 422-436.
-
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design,
Raja Jothi and Balaji Raghavachari,
ACM Transactions on Algorithms, ACM Press, Volume 1, Number 2, pages 265-282, 2005.
This page was last updated in September 2011.
Return to Balaji Raghavachari's
home page.