Title Dr. First Name P. NIRMALA Last Name
Designation Assistant Professor
Department Department of Computer Science Karaikal
Email
Webpage
Phone.no 04162654000
Employement Info
Employee Type Nature Of Employment
Teaching Permanent
Educational Qualifications
Degree/Certification Name Institution Year of Completion
Ph.D. - PhD Anna University 2018
PG Bharathidasan University 2007
UG Bharathidasan University 2005
Qualifications
Examination Name Conducting Body Date of Passing
NET UGC 05-01-2019
SET 12-01-2017
Research Publications
Title of Article Type of Publication Name of Journal ISSN Journal Volume Year Link to Article DOI (Digital Object Identifier)
TCPP-2PPIN: trustworthy centrality prediction paradigm for analyzing two protein–protein interaction networks using centrality measures and graph theory concepts Research Papers in Scopus Listed Journals Network Modeling Analysis in Health Informatics and Bioinformatics (Springer), ISSN 2192-6670 2192-6670 13(1),p.58 2024 https://link.springer.com/article/10.1007/s13721-024-00492-z https://link.springer.com/article/10.1007/s13721-024-00492-z
The Impact of Centrality Measures in Protein-Protein Interaction Networks: Tools, Databases, Challenges and Future Directions Research Papers in Scopus Listed Journals Journal of Computational Biophysics and Chemistry ISSN (print): 2737-4165 | ISSN (online): 2737-4173 Vol. 23, no.6, pp. 815-836 2024 https://www.worldscientific.com/doi/abs/10.1142/S2737416524400076 https://doi.org/10.1142/S2737416524400076
How do centrality measures help to predict similarity patterns in molecular chemical structural graphs? Research Papers in Peer Reviewed Journals Artificial Intelligence Chemistry (Elsevier peer reviewed journal) ISSN: 2949-7477 1, no.2, pp.100007 2023 https://www.sciencedirect.com/science/article/pii/S2949747723000076 https://doi.org/10.1016/j.aichem.2023.100007
Cumulative centrality index: centrality measures based ranking technique for molecular chemical structural graphs Research Papers in UGC listed Journals Journal of Molecular Structure (Elsevier) Online ISSN: 1872-8014 Print ISSN: 0022-2860 vol.1247, p.131354 2021 https://www.sciencedirect.com/science/article/abs/pii/S0022286021014836 https://doi.org/10.1016/j.molstruc.2021.131354
Eigenvector centrality based algorithm for finding a maximal common connected vertex induced molecular substructure of two chemical graphs Research Papers in Scopus Listed Journals Journal of Molecular Structure (Elsevier) vol.1244, p.130980 2021 https://www.sciencedirect.com/science/article/abs/pii/S0022286021011121 https://doi.org/10.1016/j.molstruc.2021.130980
Centrality measures based algorithm for computing a maximal common connected edge subgraph of two chemical graphs Research Papers in Scopus Listed Journals MATCH-Communications in Mathematical and in Computer Chemistry journal vol. 77, no. 2, 273-296 2017 chrome-extension://efaidnbmnnnibpcajpcglclefindmkaj/https://d1wqtxts1xzle7.cloudfront.net/86818620/match77n2_273-296-libre.pdf?1654075928=&response-content-disposition=inline%3B+filename%3DCentrality_Measures_based_Algorithm_for.pdf&Expires=1743672259&Signature=WyjK3-hqxVD8BuMs5mkEVYmg0b5NAgiAuCdU1tg3FtYNZRf7kaqrOu~X2tvcIExAXftttqD0oyLYha-mKI03g7L3LB3DoWs0gKHOkhz4QouzFDF8gC8MhUlh0BPfbqOGCSeH7KhIUMIauwNO2zOblZc6dZdLWlqCi1N7V2YXJ6oagzjHdwXo5tChcs03tVaYOdG40Ds2FZfB3ZNDGuYtDvdn4IZFoK-uWiE~~zjWPBM~tJcGEk0VjZazIhCnKa49uftc6iF24r1Q~HFKF~us7Ps7FBDMi3Pf~Jyl~KfUrSzXh~AcEjlxKt8cSTlIA2eMAWJ3j5JnjzFi6hiPtmj6UA__&Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA
Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks Research Papers in Scopus Listed Journals Knowledge and Information Systems, Springer vol.48, pp 229–252 2015 https://doi.org/10.1007/s10115-015-0874-z https://doi.org/10.1007/s10115-015-0874-z
Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks Research Papers in Scopus Listed Journals Knowledge and Information Systems, Springer 2015 https://doi.org/10.1007/s10115-015-0844-5 https://doi.org/10.1007/s10115-015-0844-5
FP-GraphMiner – A Fast Frequent Pattern Mining Algorithm for Netwrok Graphs Research Papers in Scopus Listed Journals Journal of Graph Algorithms and Applications 2011
A divisive clustering algorithm for performance monitoring of large networks using maximum common subgraphs Research Papers in Scopus Listed Journals International Journal of Artificial Intelligence, 2011
Performance monitoring of large communication networks using maximum common subgraphs Research Papers in Scopus Listed Journals International Journal of Artificial Intelligence 2011
Non-Journal Publications
Title of Publication Type of Publication Publisher Role ISBN Year Link to Publication Level
Deep Reach Centrality: An Innovative Network Centrality Metric Grounded in Distance and Degree, with Its Performance Analysis Applied to the SARS-CoV- Chapters in Books Singapore: Springer Nature Singapore (https://doi.org/10.1007/978-981-97-3604-1_22) Author 2024 International
An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks Full Paper in Conference Proceedings/Other IEEE Author 2016 International
* This site is designed and developed by Samarth eGov and the content is provided by the individual. For further details, please contact the individual / university.
© Samarth eGov Suite - 2025