FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs. - Ramasamy Vijayalakshmi; Nadarajan Rethnasamy; John F. Roddick; M. Thilaga; Parisutham Nirmala (J. Graph Algorithms Appl., 2011)

A heuristic branch-and-bound based thresholding algorithm for unveiling cognitive activity from EEG data. - M. Thilaga; Ramasamy Vijayalakshmi; Nadarajan Rethnasamy; D. Nandagopal; Bernie Cocks; C. Archana; Nabaraj Dahal (Neurocomputing, 2015)

An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks. - Parisutham Nirmala; Nadarajan Rethnasamy (COMSNETS, 2016)

Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks. - Parisutham Nirmala; Lekshmi Ramasubramony Sulochana; Nadarajan Rethnasamy (Knowl. Inf. Syst., 2016)

Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. - Parisutham Nirmala; Lekshmi Ramasubramony Sulochana; Nadarajan Rethnasamy (Knowl. Inf. Syst., 2016)

ERI-Query graph miner: an algorithm to detect edge relaxed induced query graph in large dynamic communication networks. - Parisutham Nirmala; Nadarajan Rethnasamy (Expert Syst. Appl., 2026)