N. Safina Devi

According to our database, N. Safina Devi authored at least 4 papers between 2011 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

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

2014

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.

Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh

Theor. Comput. Sci., 2014

2011

Approximation Algorithms for Minimum Chain Vertex Deletion.

Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011