N. Safina Devi

Publication Activity (10 Years)

Years Active: 2011-2015
Publications (10 Years): 2

Top Topics

Bipartite Graph

Approximation Algorithms

Top Venues

Discret. Appl. Math.

J. Discrete Algorithms

Theor. Comput. Sci.

Publications

N. Safina Devi, Aniket C. Mane, Sounaka Mishra
Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs. Discret. Appl. Math. 184 (2015)
Sounaka Mishra, Ashwin Pananjady, N. Safina Devi
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion. J. Discrete Algorithms 33 (2015)
Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theor. Comput. Sci. 526 (2014)
Sounaka Mishra, Ashwin Pananjady, N. Safina Devi
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion. CoRR (2013)
Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
Approximation Algorithms for Minimum Chain Vertex Deletion. WALCOM (2011)