T. N. Janakiraman

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2017 J jnl
An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks.
Int. J. Distributed Syst. Technol.
P. J. A. Alphonse, Sivaraj Chinnasamy, T. N. Janakiraman
2017 J jnl
Independent Neighbour Set based Clustering Algorithm for Routing in Wireless Sensor Networks.
Wirel. Pers. Commun.
Sivaraj Chinnasamy, P. J. A. Alphonse, T. N. Janakiraman
2014 J jnl
Comfortability of a Team in Social Networks.
CoRR
Lakshmi Prabha S, T. N. Janakiraman
2014 J jnl
Existence of Comfortable Team in some Special Social Networks.
CoRR
Lakshmi Prabha S, T. N. Janakiraman
2014 J jnl
Polynomial-time Approximation Algorithm for finding Highly Comfortable Team in any given Social Network.
CoRR
Lakshmi Prabha S, T. N. Janakiraman
2011 J jnl
A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index
CoRR
T. N. Janakiraman, A. Senthil Thilak
2011 J jnl
Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs
CoRR
T. N. Janakiraman, A. Senthil Thilak
2010 J jnl
Efficient clustering for mobile ad hoc networks using K-hop weighted paired domination.
Int. J. Inf. Commun. Technol.
T. N. Janakiraman, J. Janet Lourds Rani
2010 J jnl
Image Segmentation using Euler Graphs.
Int. J. Comput. Commun. Control
T. N. Janakiraman, P. V. S. S. R. Chandra Mouli
2008 J jnl
Self-centered super graph of a graph and center number of a graph.
Ars Comb.
T. N. Janakiraman, M. Bhanumathi, S. Muthammai
2007 J jnl
On Splitting Graphs.
Ars Comb.
T. N. Janakiraman, S. Muthammai, M. Bhanumathi
2005 J jnl
New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems.
Int. J. Comput. Math.
V. N. Sastry, T. N. Janakiraman, S. Ismail Mohideen
1994 J jnl
On special classes of self-centred graphs.
Discret. Math.
T. N. Janakiraman