Get started
Author

T. N. Janakiraman

Observed names: Janakiraman T N, Janakiraman T N., Janakiraman, T. N., T N Janakiraman, T.N. Janakiraman, Thenkarai N. Janakiraman
OpenAlex ID: A5002171843
New Algorithms For Multi Objective Shortest Path Problem
2003 · V. N. Sastry, T. N. Janakiraman, et al. · OPSEARCH · 26
Manufacturing Data-Based Combined Dissimilarity Coefficient for Machine Cell Formation
2002 · G. Prabhakaran, T. N. Janakiraman, et al. · The International Journal of Advanced Manufacturing Technology · 20
Image Segmentation Based on Minimal Spanning Tree and Cycles
2007 · T. N. Janakiraman, P.V.S.S.R. Chandra Mouli · International Conference on Computational Intelligence and Multimedia Applications (ICCIMA) · 18
New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
2005 · V. N. Sastry, T. N. Janakiraman, et al. · International Journal of Computer Mathematics · 15
Independent Neighbour Set based Clustering Algorithm for Routing in Wireless Sensor Networks
2017 · C. Sivaraj, P. J. A. Alphonse, et al. · Wireless Personal Communications · 13
Image Segmentation using Euler Graphs
2010 · T.N. Janakiraman, P.V.S.S.R. Chandra Mouli · International Journal of Computers Communications & Control · 12
PDF
Energy-efficient and Load Distributed Clustering Algorithm for Dense Wireless Sensor Networks
2017 · Sivaraj C, Alphonse P J A, et al. · International Journal of Intelligent Systems and Applications · 10
PDF
Self-centered super graph of a graph and center number of a graph.
2008 · T. N. Janakiraman, M. Bhanumathi, et al. · Ars Combinatoria · 9
On the Boolean function graph of a graph and on its complement
2005 · T. N. Janakiraman, S. Muthammai, et al. · Mathematica Bohemica · 9
PDF
Graceful Labeling of Generalized Theta graphs
2018 · G. Sathiamoorthy, T. N. Janakiraman · National Academy Science Letters · 6
Global domination and neighborhood numbers in Boolean function graph of a graph
2005 · T. N. Janakiraman, S. Muthammai, et al. · Mathematica Bohemica · 6
PDF
An energy efficient fault tolerance nested clustering algorithm for routing in wireless sensor networks
2016 · C. Sivaraj, P. J. A. Alphonse, et al. · International Conference on Intelligent Systems and Control · 5
A Weight Based Double Star Embedded Clustering of Homogeneous Mobile Ad Hoc Networks Using Graph Theory
2010 · T. N. Janakiraman, A. Senthil Thilak · Communications in computer and information science · 4
Color Image Edge Detection Using Pseudo-Complement And Matrix Operations
2008 · T. N. Janakiraman, P. V. S. S. R. Chandra Mouli · 4
An Efficient K-Hop Weighted Domination Clustering Algorithm for Mobile Ad Hoc Networks Using Ranking
2007 · T. N. Janakiraman, J. Janet Lourds Rani · International Conference on Computational Intelligence and Multimedia Applications (ICCIMA) · 4
On special classes of self-centred graphs
1994 · T.N. Janakiraman · Discrete Mathematics · 4
Domination numbers on the Boolean function graph of a graph
2005 · T. N. Janakiraman, S. Muthammai, et al. · Mathematica Bohemica · 3
PDF
Domination numbers on the complement of the Boolean function graph of a graph
2005 · T. N. Janakiraman, S. Muthammai, et al. · Mathematica Bohemica · 3
PDF
Automated Motion Tracking of Insects Using Invariant Moments in Image Sequence
2007 · N. Ravi Kumar, T.N. Janakiraman, et al. · International Conference on Computational Intelligence and Multimedia Applications (ICCIMA) · 2
On Splitting Graphs.
2007 · T. N. Janakiraman, S. Muthammai, et al. · Ars Combinatoria · 2
An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks
2020 · P. J. A. Alphonse, C. Sivaraj, et al. · IGI Global eBooks · 1
Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks
2017 · Sivaraj Chinnasamy, Alphonse P J A, et al. · International Journal of Intelligent Systems and Applications · 1
PDF
An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks
2017 · Alphonse PJA, Sivaraj C, et al. · International Journal of Distributed Systems and Technologies · 1
Polynomial-time Approximation Algorithm for finding Highly Comfortable Team in any given Social Network
2014 · S, Lakshmi Prabha, Janakiraman, T. N. · arXiv (Cornell University) · 1
PDF
Graceful Labeling of Hanging Theta Graphs
2013 · T.N. Janakiraman, G. Sathiamoorthy · International Journal of Pure and Apllied Mathematics · 1
PDF
Works count: 50
Citation count: 183
H-index: 9
I10-index: 7
Year
Topic
Type