Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian. The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. Algorithmica, 61(4):857-881, 2011. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: König Deletion Sets and Vertex Covers above the Matching SizeSounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. isaac 2008: 836-847 [doi] The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover NumberSounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian. isaac 2007: 268-279 [doi]
The following publications are possibly variants of this publication: