List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion Journal of Discrete Algorithms | 2015-08-18 | Paper |
| Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs Discrete Applied Mathematics | 2015-04-28 | Paper |
| Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization Theoretical Computer Science | 2014-03-13 | Paper |
| Approximation algorithms for minimum chain vertex deletion WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Research outcomes over time
This page was built for person: N. Safina Devi
