Approximation Algorithms for Minimum Chain Vertex Deletion. - Mrinal Kumar 001; Sounaka Mishra; N. Safina Devi; Saket Saurabh 001 (WALCOM, 2011)

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. - Mrinal Kumar 001; Sounaka Mishra; N. Safina Devi; Saket Saurabh 001 (Theor. Comput. Sci., 2014)

Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs. - N. Safina Devi; Aniket C. Mane; Sounaka Mishra (Discret. Appl. Math., 2015)

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion. - Sounaka Mishra; Ashwin Pananjady; N. Safina Devi (J. Discrete Algorithms, 2015)