![]() | ![]() |
| 2012 | ||
|---|---|---|
| 30 | S. Arumugam, Varughese Mathew: The fractional metric dimension of graphs. Discrete Mathematics 312(9): 1584-1590 (2012) | |
| 2011 | ||
| 29 | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA 2011: 19-30 | |
| 28 | J. Senthilkumar, M. Chandrasekaran, Y. Suresh, S. Arumugam, V. Mohanraj: Advertisement timeout driven bee's mating approach to maintain fair energy level in sensor networks. Appl. Soft Comput. 11(5): 4029-4035 (2011) | |
| 27 | S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie: Maximal independent sets in minimum colorings. Discrete Mathematics 311(13): 1158-1163 (2011) | |
| 2010 | ||
| 26 | S. Rathinavel, S. Arumugam: Threshold Based Indexing of Commercial Shoe Print to Create Reference and Recovery Images CoRR abs/1001.5359: (2010) | |
| 2009 | ||
| 25 | Y. Suresh, S. Arumugam, M. Chandrasekaran, J. Senthilkumar, V. Mohanraj: A QSPS-PSR Approach on Differentiated TCP Flows for Internet Traffic. ARTCom 2009: 263-265 | |
| 24 | R. Karthi, S. Arumugam, K. Rameshkumar: A novel discrete particle swarm clustering algorithm for data clustering. Bangalore Compute Conf. 2009: 16 | |
| 2008 | ||
| 23 | N. Mohankumar, B. Bhuvan, M. Nirmala Devi, S. Arumugam: A Modified Genetic Algorithm for Evolution of Neural Network in Designing an Evolutionary Neuro-Hardware. GEM 2008: 108-111 | |
| 22 | Venakata Saichand, M. Nirmala Devi, S. Arumugam, N. Mohankumar: FPGA Realization of Activation Function for Artificial Neural Networks. ISDA (3) 2008: 159-164 | |
| 21 | R. Karthi, S. Arumugam, K. Rameshkumar: Discrete Particle Swarm Optimization Algorithm for Data Clustering. NICSO 2008: 75-88 | |
| 20 | K. Reji Kumar, S. Arumugam, Gary MacGillivray: On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87: (2008) | |
| 19 | L. S. Jayashree, S. Arumugam, A. R. Meenakshi: A communication-efficient framework for outlier-free data reporting in data-gathering sensor networks. Int. Journal of Network Management 18(5): 437-445 (2008) | |
| 2007 | ||
| 18 | R. M. Suresh, S. Arumugam: Fuzzy technique based recognition of handwritten characters. Image Vision Comput. 25(2): 230-239 (2007) | |
| 17 | L. S. Jayashree, S. Arumugam, K. Vijayalakshmi: A Robust Outlier Detection Scheme for Collaborative Sensor Networks. JDIM 5(1): 13-18 (2007) | |
| 2006 | ||
| 16 | K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar: Texture image segmentation using combined features from spatial and spectral distribution. Pattern Recognition Letters 27(7): 755-764 (2006) | |
| 2005 | ||
| 15 | K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar: Texture classification with combined rotation and scale invariant wavelet features. Pattern Recognition 38(10): 1495-1506 (2005) | |
| 2004 | ||
| 14 | R. S. Rajesh, S. Arumugam: An Optimistic Deadlock Free Adaptive Wormhole Routing Algorithm for Two Dimensional Meshes. Communications in Computing 2004: 21-24 | |
| 13 | S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam: On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number. Ars Comb. 72: (2004) | |
| 2003 | ||
| 12 | R. M. Suresh, S. Arumugam: Fuzzy Technique Based Recognition of Handwritten Characters. WILF 2003: 297-308 | |
| 11 | S. Arumugam, Hepzibai Jeyakumar: Asteroidal Chromatic Number of a Graph. Electronic Notes in Discrete Mathematics 15: 241-243 (2003) | |
| 2001 | ||
| 10 | S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam: Graphs whose acyclic graphoidal covering number is one less than its maximum degree. Discrete Mathematics 240(1-3): 231-237 (2001) | |
| 2000 | ||
| 9 | K. Ramar, S. Arumugam, S. N. Sivanandam, L. Ganesan, D. Manimegalai: Quantitative fuzzy measures for threshold selection. Pattern Recognition Letters 21(1): 1-7 (2000) | |
| 8 | S. Thamarai Selvi, S. Arumugam, L. Ganesan: BIONET: an artificial neural network model for diagnosis of diseases. Pattern Recognition Letters 21(8): 721-740 (2000) | |
| 1999 | ||
| 7 | S. Arumugam, S. Velammal: Maximum Size of a Connected Graph with Given Domination Parameters. Ars Comb. 52: (1999) | |
| 6 | S. Arumugam, J. Paulraj Joseph: On graphs with equal domination and connected domination numbers. Discrete Mathematics 206(1-3): 45-49 (1999) | |
| 1998 | ||
| 5 | S. Arumugam, J. Suresh Suseela: Acyclic graphoidal covers and path partitions in a graph. Discrete Mathematics 190(1-3): 67-77 (1998) | |
| 1996 | ||
| 4 | S. Arumugam, A. Thuraiswamy: Total domination in graphs. Ars Comb. 43: (1996) | |
| 3 | S. Arumugam, R. Kala: Domination parameters of star graph. Ars Comb. 44: (1996) | |
| 2 | S. Arumugam, K. A. Germina: On indexable graphs. Discrete Mathematics 161(1-3): 285-289 (1996) | |
| 1994 | ||
| 1 | S. Arumugam, C. Pakkiam: Graphoidal bipartite graphs. Graphs and Combinatorics 10(2-4): 305-310 (1994) | |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page