Dr. N. Safina Devi

Teaching Experience: 3 Years
Area of Specialization: Discrete Mathematics, Real Analysis
Area of Research: Combinatorial Optimization, Graph Theory
Additional Roles & Responsibilities VEEOCEE Academy Academic Counselor Question Paper setter for Autonomous Colleges Doctoral Committee Member – St.Mary’s College, Thoothukudi
Research Guidance: -	Publications: 5	Projects: -
Three Important Publications N. Safina Devi, Sounaka Mishra, Ashwin Pananjady: On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion. J. Discrete Algorithms 33: 71-80 (2015). N. Safina Devi, Aniket C. Mane, Sounaka Mishra: Computational complexity of minimum P4 vertex cover problem for regular and K1;4-free graphs. Discrete Applied Mathematics 184: 114-121 (2015). N. Safina Devi, Mrinal Kumar, Sounaka Mishra, Saket Saurabh: Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theoretical Computer Science 526: 90-96 (2014).
Research IDs	Google Scholar: ‪https://scholar.google.com/citations?hl=en&user=1l4NsgMAAAAJ ‬‬‬‬‬ Research Gate: https://www.researchgate.net/profile/Safina_Devi_N Orcid: https://orcid.org/0000-0003-3899-0727 Publon: AAE-3194-2019

Our Team