 | 2009 |
|---|
| 20 |       | R. Karthi,
S. Arumugam,
K. RameshKumar:
A novel discrete particle swarm clustering algorithm for data clustering.
Bangalore Compute Conf. 2009: 16 |
| 2008 |
|---|
| 19 |  | 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 |
| 18 | | K. Reji Kumar,
S. Arumugam,
Gary MacGillivray:
On Maximal Fractional Independent Sets In Graphs.
Ars Comb. 87: (2008) |
| 17 | | 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 |
|---|
| 16 | | R. M. Suresh,
S. Arumugam:
Fuzzy technique based recognition of handwritten characters.
Image Vision Comput. 25(2): 230-239 (2007) |
| 2006 |
|---|
| 15 | | 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 |
|---|
| 14 | | 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 |
|---|
| 13 | | R. S. Rajesh,
S. Arumugam:
An Optimistic Deadlock Free Adaptive Wormhole Routing Algorithm for Two Dimensional Meshes.
Communications in Computing 2004: 21-24 |
| 12 | | 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 |
|---|
| 11 | | R. M. Suresh,
S. Arumugam:
Fuzzy Technique Based Recognition of Handwritten Characters.
WILF 2003: 297-308 |
| 10 | | S. Arumugam,
Hepzibai Jeyakumar:
Asteroidal Chromatic Number of a Graph.
Electronic Notes in Discrete Mathematics 15: 241-243 (2003) |
| 2001 |
|---|
| 9 | | 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 |
|---|
| 8 | | 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) |
| 7 | | 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 |
|---|
| 6 | | S. Arumugam,
S. Velammal:
Maximum Size of a Connected Graph with Given Domination Parameters.
Ars Comb. 52: (1999) |
| 5 | | S. Arumugam,
J. Paulraj Joseph:
On graphs with equal domination and connected domination numbers.
Discrete Mathematics 206(1-3): 45-49 (1999) |
| 1998 |
|---|
| 4 | | S. Arumugam,
J. Suresh Suseela:
Acyclic graphoidal covers and path partitions in a graph.
Discrete Mathematics 190(1-3): 67-77 (1998) |
| 1996 |
|---|
| 3 | | S. Arumugam,
A. Thuraiswamy:
Total domination in graphs.
Ars Comb. 43: (1996) |
| 2 | | S. Arumugam,
R. Kala:
Domination parameters of star graph.
Ars Comb. 44: (1996) |
| 1 | | S. Arumugam,
K. A. Germina:
On indexable graphs.
Discrete Mathematics 161(1-3): 285-289 (1996) |
