dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

T. N. Janakiraman Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLT. N. Janakiraman, A. Senthil Thilak: A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index CoRR abs/1104.5705: (2011)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLT. N. Janakiraman, A. Senthil Thilak: Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs CoRR abs/1105.5521: (2011)
2010
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLT. N. Janakiraman, J. Janet Lourds Rani: Efficient clustering for mobile ad hoc networks using K-hop weighted paired domination. IJICT 2(3): 228-243 (2010)
2008
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLT. N. Janakiraman, M. Bhanumathi, S. Muthammai: Self-centered super graph of a graph and center number of a graph. Ars Comb. 87: (2008)
2007
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLT. N. Janakiraman, S. Muthammai, M. Bhanumathi: On Splitting Graphs. Ars Comb. 82: (2007)
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLV. N. Sastry, T. N. Janakiraman, S. Ismail Mohideen: New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems. Int. J. Comput. Math. 82(3): 289-300 (2005)

Coauthor Index

1M. Bhanumathi [2] [3]
2S. Ismail Mohideen [1]
3S. Muthammai [2] [3]
4J. Janet Lourds Rani [4]
5V. N. Sastry [1]
6A. Senthil Thilak [5] [6]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page