{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:24Z","timestamp":1759638804231},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_73","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"836-847","source":"Crossref","is-referenced-by-count":3,"title":["K\u00f6nig Deletion Sets and Vertex Covers above the Matching Size"],"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"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(92)90273-D","volume":"24","author":"J..M. Bourjolly","year":"1989","unstructured":"Bourjolly, J.M., Pulleyblank, W.R.: K\u00f6nig-Egerv\u00e1ry Graphs, 2-Bicritical Graphs and Fractional Matchings. Disc. Appl. Math.\u00a024, 63\u201382 (1989)","journal-title":"Disc. Appl. Math."},{"issue":"4","key":"73_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. Inform. Proc. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inform. Proc. Lett."},{"key":"73_CR3","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\u00e1ryTheorem. Disc. Math.\u00a027, 23\u201333 (1979)","journal-title":"Disc. Math."},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.endm.2004.03.029","volume":"17","author":"U. Faigle","year":"2004","unstructured":"Faigle, U., Fuchs, B., Wienand, B.: Covering Graphs by Colored Stable Sets. Electronic Notes in Disc. Math.\u00a017, 145\u2013149 (2004)","journal-title":"Electronic Notes in Disc. Math."},{"key":"73_CR5","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. In: Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La, pp.\u00a0311-315, Congressus Numerantium, Winnipeg, vol.\u00a0XIX, Utilitas Math. (1977)"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A Simple\u00a0O(20.288n ) Independent Set Algorithm. In: Proc. of SODA 2006, pp. 18\u201325 (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"73_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0020-0190(93)90038-B","volume":"45","author":"F. Gavril","year":"1993","unstructured":"Gavril, F.: An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. Inform. Proc. Lett.\u00a045, 285\u2013290 (1993)","journal-title":"Inform. Proc. Lett."},{"issue":"3","key":"73_CR8","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"F. Gavril","year":"1980","unstructured":"Gavril, F., Yannakakis, M.: Edge Dominating Sets in Graphs. SIAM Jour. Appl. Math.\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM Jour. Appl. Math."},{"key":"73_CR9","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: Proc. of SODA 2006, pp. 842\u2013850 (2006)","DOI":"10.1145\/1109557.1109650"},{"key":"73_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579346","volume":"3","author":"L. Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Ear-Decompositions of Matching-covered Graphs. Combinatorica\u00a03, 105\u2013118 (1983)","journal-title":"Combinatorica"},{"key":"73_CR11","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North Holland, Amsterdam (1986)"},{"key":"73_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-77120-3_25","volume-title":"Algorithms and Computation","author":"S. Mishra","year":"2007","unstructured":"Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 268\u2013279. Springer, Heidelberg (2007)"},{"key":"73_CR13","unstructured":"Moser, H., Thilikos, D.M.: Parameterized Complexity of Finding Regular Induced Subgraphs. In: Proc. of ACiD 2006, pp. 107\u2013118 (2006)"},{"key":"73_CR14","doi-asserted-by":"publisher","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":"73_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00224-007-1334-2","volume":"41","author":"V. Raman","year":"2007","unstructured":"Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms Through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Systems\u00a041, 563\u2013587 (2007)","journal-title":"Theory Comput. Systems"},{"key":"73_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-540-70575-8_45","volume-title":"Automata, Languages and Programming","author":"I. Razgon","year":"2008","unstructured":"Razgon, I., O\u2019Sullivan, B.: Almost 2-SAT is Fixed-Parameter Tractable. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 551\u2013562. Springer, Heidelberg (2008)"},{"key":"73_CR17","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":"73_CR18","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, Ser.\u00a0B\u00a027, 228\u2013229 (1979)","journal-title":"Jour. of Comb. Theory, Ser.\u00a0B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:44:17Z","timestamp":1557978257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}