The following pages link to N. Safina Devi (Q491618):
Displayed 4 items.
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
- Approximation Algorithms for Minimum Chain Vertex Deletion (Q3078376) (← links)