The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Raja Jothi" ( http://dblp.L3S.de/Authors/Raja_Jothi )

  Author page on DBLP  Author page in RDF  Community of Raja Jothi in ASPL-2

Publication years (Num. hits)
2003-2007 (16) 2008-2011 (5)
Publication types (Num. hits)
article(12) inproceedings(9)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 7 keywords

Results
Found 21 publication records. Showing 21 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin, Balaji Raghavachari, Raja Jothi DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Search on Bibsonomy Nucleic Acids Research The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mei Liu, Xue-wen Chen, Raja Jothi Knowledge-guided inference of domain-domain interactions from incomplete protein-protein interaction networks. Search on Bibsonomy Bioinformatics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Degree-bounded minimum spanning trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Improved approximation algorithms for the single-sink buy-at-bulk network design problems. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi DOMINE: a database of protein domain interactions. Search on Bibsonomy Nucleic Acids Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Teresa M. Przytycka, L. Aravind Discovering functional linkages and uncharacterized cellular pathways using phylogenetic profile comparisons: a comprehensive assessment. Search on Bibsonomy BMC Bioinformatics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Approximating the k-traveling repairman problem with repairtimes. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi Load-balanced agent activation for value-added network services. Search on Bibsonomy Computer Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Elena Zotenko, Asba Tasneem, Teresa M. Przytycka COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations. Search on Bibsonomy Bioinformatics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Elena 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. Search on Bibsonomy Algorithms for Molecular Biology The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation algorithms, network design, Spanning trees, minimum spanning trees
1Raja Jothi, Maricel G. Kann, Teresa M. Przytycka Predicting protein-protein interaction by searching evolutionary tree automorphism space. Search on Bibsonomy ISMB (Supplement of Bioinformatics) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Elena 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. Search on Bibsonomy Systems Biology and Regulatory Genomics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Survivable network design: the capacitated minimum spanning network problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Minimum Latency Tours and the k-Traveling Repairmen Problem. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari Degree-bounded minimum spanning trees. Search on Bibsonomy CCCG The full citation details ... 2004 DBLP  BibTeX  RDF
1Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. Search on Bibsonomy SAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF NAK-suppression, feedback implosion, graph theory, system design, reliable multicast
1Raja Jothi, Balaji Raghavachari Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. Search on Bibsonomy SWAT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç Load balancing for reliable multicast. Search on Bibsonomy Communications, Internet, and Information Technology The full citation details ... 2004 DBLP  BibTeX  RDF
1Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan A 5/4-approximation algorithm for minimum 2-edge-connectivity. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #21 of 21 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.