{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T02:47:47Z","timestamp":1769050067449,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T00:00:00Z","timestamp":1196985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00453-007-9146-y","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T17:57:39Z","timestamp":1196963859000},"page":"167-176","source":"Crossref","is-referenced-by-count":38,"title":["Faster Fixed-Parameter Tractable Algorithms for\u00a0Matching and Packing Problems"],"prefix":"10.1007","volume":"52","author":[{"given":"M. R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ragde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Stege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,7]]},"reference":[{"issue":"4","key":"9146_CR1","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. J.\u00a0Assoc. Comput. Mach. 42(4), 844\u2013856 (1995)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"9146_CR2","doi-asserted-by":"crossref","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. J.\u00a0Comput. Syst. Sci. 21, 136\u2013153 (1980)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9146_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-45294-X_11","volume-title":"Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS)","author":"J. Chen","year":"2001","unstructured":"Chen, J., Friesen, D.K., Jia, W., Kanj, I.: Using nondeterminism to design deterministic algorithms. In: Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS). Lecture Notes in Computer Science, vol.\u00a02245, pp.\u00a0120\u2013131. Springer, New York (2001)"},{"key":"9146_CR4","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0298\u2013307 (2007)"},{"key":"9146_CR5","doi-asserted-by":"crossref","unstructured":"Chor, B., Fellows, M.R., Juedes, D.: Linear kernels in linear time, or how to save k colors in\u00a0O(n 2) steps. In: Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), pp.\u00a0257\u2013269 (2004)","DOI":"10.1007\/978-3-540-30559-0_22"},{"key":"9146_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u00a003)","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-ups, win\/win\u2019s, and crown rules: some new directions in\u00a0FPT. In: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u00a003). Lecture Notes in Computer Science, vol.\u00a02880, pp.\u00a01\u201312. Springer, New York (2003)"},{"key":"9146_CR7","doi-asserted-by":"crossref","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: Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), pp.\u00a0257\u2013269 (2004)","DOI":"10.1007\/978-3-540-30559-0_20"},{"key":"9146_CR8","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Proceedings of the 12th Annual European Symposium on Algorithms (ESA), pp.\u00a0311\u2013322 (2004)","DOI":"10.1007\/978-3-540-30140-0_29"},{"key":"9146_CR9","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.\u00a0165\u2013169 (1982)","DOI":"10.1109\/SFCS.1982.39"},{"issue":"1","key":"9146_CR10","doi-asserted-by":"crossref","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. J.\u00a0Algorithms 50(1), 106\u2013117 (2004)","journal-title":"J.\u00a0Algorithms"},{"key":"9146_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.\u00a085\u2013103. Plenum, New York (1972)"},{"key":"9146_CR12","doi-asserted-by":"crossref","unstructured":"Kneis, J., Moelle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.\u00a058\u201367 (2006)","DOI":"10.1007\/11917496_6"},{"key":"9146_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.12.005","volume":"94","author":"I. Koutis","year":"2005","unstructured":"Koutis, I.: A faster parameterized algorithm for set packing. Inf. Process. Lett. 94, 7\u20139 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9146_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/11847250_8","volume-title":"Proceedings of the 2nd International Workshop on Parameterized and Exact Computation","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Lu, S., Chen, J., Sze, S.: Greedy localization and color-coding: improved matching and packing algorithms. In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Computer Science, vol.\u00a04162, pp.\u00a084\u201395. Springer, New York (2006)"},{"key":"9146_CR15","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"},{"issue":"4\/5","key":"9146_CR16","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. Elektron. Inf. Kybern. 21(4\/5), 246\u2013253 (1985)","journal-title":"Elektron. Inf. Kybern."},{"key":"9146_CR17","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization\u2014Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems, a survey. In: Combinatorial Optimization\u2014Eureka, You Shrink!. Lecture Notes on Computer Science, vol.\u00a02570, pp.\u00a0185\u2013207. Springer, New York (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9146-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9146-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9146-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9146-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,7]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9146"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9146-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,7]]}}}