T. N. Janakiraman

According to our database, T. N. Janakiraman authored at least 13 papers between 1994 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2017

Independent Neighbour Set based Clustering Algorithm for Routing in Wireless Sensor Networks.

Sivaraj Chinnasamy, P. J. A. Alphonse, T. N. Janakiraman

Wirel. Pers. Commun., 2017

An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks.

P. J. A. Alphonse, Sivaraj Chinnasamy, T. N. Janakiraman

Int. J. Distributed Syst. Technol., 2017

2014

Existence of Comfortable Team in some Special Social Networks.

Lakshmi Prabha S, T. N. Janakiraman

CoRR, 2014

Comfortability of a Team in Social Networks.

Lakshmi Prabha S, T. N. Janakiraman

CoRR, 2014

Polynomial-time Approximation Algorithm for finding Highly Comfortable Team in any given Social Network.

Lakshmi Prabha S, T. N. Janakiraman

CoRR, 2014

2011

Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs

T. N. Janakiraman, A. Senthil Thilak

CoRR, 2011

A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index

T. N. Janakiraman, A. Senthil Thilak

CoRR, 2011

2010

Efficient clustering for mobile ad hoc networks using K-hop weighted paired domination.

T. N. Janakiraman, J. Janet Lourds Rani

Int. J. Inf. Commun. Technol., 2010

Image Segmentation using Euler Graphs.

T. N. Janakiraman, P. V. S. S. R. Chandra Mouli

Int. J. Comput. Commun. Control, 2010

2008

Self-centered super graph of a graph and center number of a graph.

T. N. Janakiraman, M. Bhanumathi, S. Muthammai

Ars Comb., 2008

2007

On Splitting Graphs.

T. N. Janakiraman, S. Muthammai, M. Bhanumathi

Ars Comb., 2007

2005

New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems.

V. N. Sastry, T. N. Janakiraman, S. Ismail Mohideen

Int. J. Comput. Math., 2005

1994

On special classes of self-centred graphs.

T. N. Janakiraman

Discret. Math., 1994