{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:20Z","timestamp":1759638860881},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_20","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"235-244","source":"Crossref","is-referenced-by-count":27,"title":["Finding k Disjoint Triangles in an Arbitrary Graph"],"prefix":"10.1007","author":[{"given":"Mike","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Sloper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"AbuKhzam, F., Suters, H.: Computer Science Department, University of Tennessee, Knoxville, private communications (December 2003)","key":"20_CR1"},{"doi-asserted-by":"crossref","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-Coding. J. ACM, 844\u2013856 (1995)","key":"20_CR2","DOI":"10.1145\/210332.210337"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings ALENEX 2004","author":"F. Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F., Collins, R., Fellows, M., Langston, M.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proceedings ALENEX 2004. LNCS, Springer, Heidelberg (2004) (to appear)"},{"unstructured":"Chor, B., Fellows, M., Juedes, D.: Saving k Colors in Time O(n 5\/2). Manuscript (2003)","key":"20_CR4"},{"key":"20_CR5","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., Juedes, D.W.: Linear kernels in linear time, or how to save k colors in o(n 2) steps. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 257\u2013269. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences\u00a067 (2003)","key":"20_CR6","DOI":"10.1016\/S0022-0000(03)00074-6"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S1571-0661(04)81014-4","volume":"78","author":"R. Downey","year":"2003","unstructured":"Downey, R., Estivill-Castro, V., Fellows, M., Prieto-Rodriguez, E., Rosamond, F.: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electronic Notes in Theoretical Computer Science\u00a0vol. 78, pp. 205\u2013218 (2003)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M., Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. In: Graham, R., Kratochvil, J., Nesetril, J., Roberts, F. (eds.) Contemporary Trends in Discrete Mathematics, AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a049, pp. 49\u201399 (1999)","key":"20_CR9","DOI":"10.1090\/dimacs\/049\/04"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Can. J. Math.\u00a017(3), 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"20_CR11","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)"},{"doi-asserted-by":"crossref","unstructured":"Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Proceedings of 10th ACM Symposium on theory of computing, pp. 309\u2013318 (1978)","key":"20_CR12","DOI":"10.1145\/800133.804353"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Disc. Math. 2, 68\u201372 (1989)","journal-title":"SIAM J. Disc. Math."},{"issue":"1","key":"20_CR14","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.r)","journal-title":"Journal of Algorithms"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Process. Lett.\u00a037, 27\u201335 (1991)","journal-title":"Inform. Process. Lett."},{"key":"20_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. Woeginger","year":"2003","unstructured":"Woeginger, G.: 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","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:19Z","timestamp":1605759739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}