{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002749},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_16","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"174-186","source":"Crossref","is-referenced-by-count":6,"title":["Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity"],"prefix":"10.1007","author":[{"given":"Miroslav","family":"Chleb\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janka","family":"Chleb\u00edkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proceeding of Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana (January 2004)"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"J.F. Buss","year":"1993","unstructured":"Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing\u00a022(3), 560\u2013573 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR3","unstructured":"Chor, B., Fellows, M., Juedes, D.: An efficient FPT algorithm for saving k colors (2003) (manuscript)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.jcss.2003.09.003","volume":"67","author":"J. Chen","year":"2003","unstructured":"Chen, J., Kanj, I.A.: On constrained minimum vertex covers of bipartite graphs: improved algorithms. Journal of Computer Systems Sci.\u00a067, 833\u2013847 (2003)","journal-title":"Journal of Computer Systems Sci."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-39890-5_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Dehne","year":"2003","unstructured":"Dehne, F., Fellows, M.R., Rosamond, F.A.: An FPT algorithm for set splitting. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 180\u2013191. Springer, Heidelberg (2003)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: The importance of being biased. In: STOC, 2002, pp. 33\u201342 (2002)","DOI":"10.1145\/509907.509915"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H. Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 564\u2013573. Springer, Heidelberg (2002)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"V. Goldberg","year":"1988","unstructured":"Goldberg, V., Tarjan, R.E.: A new approach to the maximum-flow problem. Journal of ACM\u00a035, 921\u2013940 (1988)","journal-title":"Journal of ACM"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.M.: An O(n2.5) algorithm for maximum matching in bipartite graphs. SIAM J. Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"key":"16_CR11","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston (1976)"},{"key":"16_CR12","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An O(_|V ||E|) algorithm for finding maximum matching in general graphs. In: Proc. of 21st IEEE Symposium on Foundation of Computer Science, Syracuse, New York, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Programming\u00a08, 232\u2013248 (1975)","journal-title":"Math. Programming"},{"issue":"2","key":"16_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for weighted vertex cover. Journal of Algorithms\u00a047(2), 63\u201377 (2003)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:40Z","timestamp":1605741700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}