{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:22:20Z","timestamp":1759742540472},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_29","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:31:13Z","timestamp":1284845473000},"page":"311-322","source":"Crossref","is-referenced-by-count":18,"title":["Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[]},{"given":"C.","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"N.","family":"Nishimura","sequence":"additional","affiliation":[]},{"given":"P.","family":"Ragde","sequence":"additional","affiliation":[]},{"given":"F.","family":"Rosamond","sequence":"additional","affiliation":[]},{"given":"U.","family":"Stege","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]},{"given":"S.","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: Structure preserving reductions among context optimization problems. Journal of Computer and System Sciences\u00a021, 136\u2013153 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"29_CR2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the Association for Computing Machinery\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Chor","year":"2004","unstructured":"Chor, B., Fellows, M.R., Juedes, D.: Linear kernels in linear time, or how to save k colors in O(n2) steps. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 257\u2013269. Springer, Heidelberg (2004)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45294-X_11","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"J. Chen","year":"2001","unstructured":"Chen, J., Friesen, D.K., Jia, W., Kanj, I.: Using nondeterminism to design deterministic algorithms. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 120\u2013131. Springer, Heidelberg (2001)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual Symposium on the Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 1\u201312. Springer, Heidelberg (2003)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-30559-0_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2004","unstructured":"Fellows, M.R., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 235\u2013244. Springer, Heidelberg (2004)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with o(1) worst-case access time. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 165\u2013169 (1982)","DOI":"10.1109\/SFCS.1982.39"},{"issue":"4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal on Computing\u00a010(4), 713\u2013717 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jalgor.2003.07.001","volume":"50","author":"W. Jia","year":"2004","unstructured":"Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. Journal of Algorithms\u00a050(1), 106\u2013117 (2004)","journal-title":"Journal of Algorithms"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Marx, D.: Parameterized complexity of constraint satisfaction problems. In: Proceedings of the 19th Annual IEEE Conference on Computational Complexity (2004)","DOI":"10.1109\/CCC.2004.1313823"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: a parameterized view. In: Proceedings of the International Workshop on Parameterized and Exact Computation (2004)","DOI":"10.1007\/978-3-540-28639-4_12"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. In: Proceedings of the International Workshop on Parameterized and Exact Computation (2004)","DOI":"10.1007\/978-3-540-28639-4_13"},{"issue":"4\/5","key":"29_CR15","first-page":"246","volume":"21","author":"C.F. Slot","year":"1985","unstructured":"Slot, C.F., van Emde Boas, P.: On tape versus core; an application of space efficient perfect hash functions to the invariance of space. Elektronische Informationsverarbeitung und Kybernetik\u00a021(4\/5), 246\u2013253 (1985)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems, a survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:44:33Z","timestamp":1605743073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}