{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:57:44Z","timestamp":1758268664313},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"},{"type":"electronic","value":"9783540771203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77120-3_25","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:31:09Z","timestamp":1196922669000},"page":"268-279","source":"Crossref","is-referenced-by-count":10,"title":["The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number"],"prefix":"10.1007","author":[{"given":"Sounaka","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: \n                    \n                      \n                    \n                    $O(\\sqrt{\\log n})$\n                   Approximation Algorithms for Min UnCut, Min-2CNF Deletion, and Directed Cut Problems. In: Proc. of STOC 2005, pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.tcs.2004.12.034","volume":"337","author":"J. Chen","year":"2005","unstructured":"Chen, J., Kanj, I.A.: On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. Theoretical Computer Science\u00a0337, 305\u2013318 (2005)","journal-title":"Theoretical Computer Science"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","volume":"27","author":"R.W. Deming","year":"1979","unstructured":"Deming, R.W.: Independence Numbers of Graphs \u2013 An Extension of the K\u00f6nig-Egerv\u00e1ry Theorem. Discrete Mathematics\u00a027, 23\u201333 (1979)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the Hardness of Approximating Minimum Vertex Cover. Annals of Mathematics\u00a0162(1), 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1006\/jagm.1996.0833","volume":"22","author":"P.N. Klein","year":"1997","unstructured":"Klein, P.N., Plotkin, S.A., Rao, S., Tardos, E.: Approximation Algorithms for Steiner and Directed Multicuts. Jour. of Algorithms\u00a022(2), 241\u2013269 (1997)","journal-title":"Jour. of Algorithms"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Korach, E., Nguyen, T., Peis, B.: Subgraph Characterization of Red\/Blue-Split Graphs and K\u00f6nig-Egerv\u00e1ry Graphs. In: the Proc. of SODA (2006)","DOI":"10.1145\/1109557.1109650"},{"key":"25_CR8","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.\u00a0H.\u00a0Freeman and Company, New York (1979)"},{"issue":"8","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization. Jour. of Comp. and Sys. Sc.\u00a072(8), 1386\u20131396 (2006)","journal-title":"Jour. of Comp. and Sys. Sc."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is Hard to Approximate to within\u00a0n\n                           1\u2009\u2212\u2009\u03b5\n                           . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/11847250_4","volume-title":"Parameterized and Exact Computation","author":"M. Mahajan","year":"2006","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing MAX SNP Problems Above Guaranteed Values. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 38\u201349. Springer, Heidelberg (2006)"},{"key":"25_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"An Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B. Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding Odd Cycle Transversals. Operations Research Letters\u00a032, 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/3-540-63774-5_137","volume-title":"SOFSEM \u201997: Theory and Practice of Informatics","author":"H. Schroder","year":"1997","unstructured":"Schroder, H., May, A.E., Sykora, O., Vrt\u2019o, I.: Algorithms for the Vertex Bipartization Problem. In: Jeffery, K.G. (ed.) SOFSEM 1997. LNCS, vol.\u00a01338, pp. 547\u2013554. Springer, Heidelberg (1997)"},{"key":"25_CR15","unstructured":"Subramanian, C.R.: Vertex Covers: Parameterizing Above the Requirement. IMSc Technical Report (February 2001)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","volume":"27","author":"F. Sterboul","year":"1979","unstructured":"Sterboul, F.: A Characterization of Graphs in which the Transversal Number Equals the Matching Number. Jour. of Comb. Theory, Series B\u00a027, 228\u2013229 (1979)","journal-title":"Jour. of Comb. Theory, Series B"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01305952","volume":"14","author":"V.V. Vazirani","year":"1994","unstructured":"Vazirani, V.V.: A Theory of Alternating Paths and Blossoms for Proving Correctness of the \n                    \n                      \n                    \n                    $O(\\sqrt{V} E)$\n                   General Graph Maximum Matching Algorithm. Combinatorica\u00a014(1), 71\u2013109 (1994)","journal-title":"Combinatorica"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. In: the Proc. of STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:26:45Z","timestamp":1558265205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540771180","9783540771203"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}