Dr. P. Nirmala

Research Area

Dr. P. Nirmala is presently working as an Assistant Professor in the Department of Computer Science, School of Engineering and Technology, Pondicherry University, Karaikal Campus, Puducherry, India. She completed her Ph.D. in the area of graph mining in June 2018 at Anna University under the guidance of Prof. R. Nadarajan (Dean Placement & Head of AMCS Dept.). One of her doctoral committee members was a professor from IIT Madras. The Indian Examiner for her thesis evaluation was a Professor from IISc Bangalore, and the Subject Expert on her viva was from IMSc Chennai. She is UGC NET and SET qualified. She obtained her UG and PG degrees from Bharathidasan University and received University II Rank in both her degrees. She is a school topper in her 10th and 12th standards. She visited the Institute for Mathematics Sciences, National University of Singapore from July 21st to July 31st, 2015 to attend a programme on networks in biological sciences. She has presented a research paper at 8th International Conference on Communication Systems & Networks (COMSNETS 2016) with accommodation supported by IISc Bangalore. She has published 10+ research articles in Scopus and SCI indexed journals with high impact factor. Her research area includes graph based data mining, social network data analytics, networks in biological sciences. She has 14+ years of teaching experience. She worked as an Assistant Professor at PSG College of Technology, Coimbatore, from June 2008 to April 2022. She has attended several international seminars and conferences.

  • Assistant Professor


Research Guidance
0 years
Teaching Experience

Notable Publications

Nirmala, Parisutham, and Rethnasamy Nadarajan. "Cumulative centrality index: Centrality measures based ranking technique for molecular chemical structural graphs." Journal of Molecular Structure 1247 (2022): 131354.

Nirmala Parisutham, and Rethnasamy Nadarajan. "Eigenvector centrality based algorithm for finding a maximal common connected vertex induced molecular substructure of two chemical graphs." Journal of Molecular Structure 1244 (2021): 130980.

Nirmala, Parisutham, Ramasubramony Sulochana Lekshmi, and Rethnasamy Nadarajan. (2016).Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks. Knowledge and Information Systems, 46(1), 213-239.

Nirmala, Parisutham, Ramasubramony Sulochana Lekshmi, and Rethnasamy Nadarajan. "Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks." Knowledge and Information Systems 48, no. 1 (2016): 229-252.

Ramasubramony Sulochana Lekshmi, Nirmala Parisutham, and Rethnasamy Nadarajan (2017). Centrality Measures based Algorithm for Computing a Maximal Common Connected Edge Subgraph of Two Chemical Graphs. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 77(2), 273-296.

News & Events

No News to display.
No Events to display.
Translate »