The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Raja Jothi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Raja Jothi, Balaji Raghavachari
    Degree-bounded minimum spanning trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:192-195 [Conf]
  2. Raja Jothi, Balaji Raghavachari
    Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:805-818 [Conf]
  3. Raja Jothi, Maricel G. Kann, Teresa M. Przytycka
    Predicting protein-protein interaction by searching evolutionary tree automorphism space. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2005, pp:241-250 [Conf]
  4. Raja Jothi, Balaji Raghavachari
    Minimum Latency Tours and the k-Traveling Repairmen Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:423-433 [Conf]
  5. Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
    Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:334-338 [Conf]
  6. Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan
    A 5/4-approximation algorithm for minimum 2-edge-connectivity. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:725-734 [Conf]
  7. Raja Jothi, Balaji Raghavachari
    Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:336-348 [Conf]
  8. Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
    Load balancing for reliable multicast. [Citation Graph (0, 0)][DBLP]
    Communications, Internet, and Information Technology, 2004, pp:86-91 [Conf]
  9. Raja Jothi, Elena Zotenko, Asba Tasneem, Teresa M. Przytycka
    COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:7, pp:779-788 [Journal]
  10. Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi
    Load-balanced agent activation for value-added network services. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2006, v:29, n:11, pp:1905-1916 [Journal]
  11. Raja Jothi, Balaji Raghavachari
    Survivable network design: the capacitated minimum spanning network problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:183-190 [Journal]
  12. Raja Jothi, Balaji Raghavachari
    Approximating the k-traveling repairman problem with repairtimes. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:293-303 [Journal]
  13. Raja Jothi, Balaji Raghavachari
    Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:265-282 [Journal]
  14. Elena Zotenko, Katia S. Guimarães, Raja Jothi, Teresa M. Przytycka
    Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations. [Citation Graph (0, 0)][DBLP]
    Systems Biology and Regulatory Genomics, 2005, pp:23-38 [Conf]

  15. Knowledge-guided inference of domain-domain interactions from incomplete protein-protein interaction networks. [Citation Graph (, )][DBLP]


  16. Discovering functional linkages and uncharacterized cellular pathways using phylogenetic profile comparisons: a comprehensive assessment. [Citation Graph (, )][DBLP]


  17. Degree-bounded minimum spanning trees. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002