{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:45:49Z","timestamp":1776444349510,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230717","type":"print"},{"value":"9783540286394","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_12","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"127-137","source":"Crossref","is-referenced-by-count":19,"title":["Packing Edge Disjoint Triangles: A\u00a0Parameterized View"],"prefix":"10.1007","author":[{"given":"Luke","family":"Mathieson","sequence":"first","affiliation":[]},{"given":"Elena","family":"Prieto","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Shaw","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Abu-Khazam, F., Langston, M., Shanbhag, P., Symons, C.: High-Performance Tools for Fixed-Parameter Tractable Implementations. In: 29th Workshop on Graph Theoretic Concepts in Computer Science, Workshop on Fixed Parameter Tractability (2003)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","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 ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM\u00a041(1) (1994)","DOI":"10.1145\/174644.174650"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bafna, V., Pevzner, P.: Genome Rearrangements and Sorting by Reversals. SIAM J. Comput.\u00a025(2) (1996)","DOI":"10.1137\/S0097539793250627"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R., Fellows, M.: Advice Classes of Parameterized Tractability. Annals of Pure and Applied Logic\u00a084, 119\u2013138 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR6","unstructured":"Chor, B., Fellows, M., Juedes, D.: Saving k Colors in Time O(n5\/2) (manuscript in preparation)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(02)00274-0","volume":"84","author":"A. Caprara","year":"2002","unstructured":"Caprara, A., Rizzi, R.: Packing Triangles in Bounded Degree Graphs. Inf. Process. Lett.\u00a084(4), 175\u2013180 (2002)","journal-title":"Inf. Process. Lett."},{"key":"12_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)"},{"key":"12_CR9","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: A Description of the Method of Coordinatized Kernels Illustrated by Nonblocker (manuscript in preparation)"},{"key":"12_CR10","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., Rosamond, F.: An FPT Algorithm for Set Splitting. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 180\u2013191. Springer, Heidelberg (2003)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M., Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a049, pp. 49\u201399 (1999)","DOI":"10.1090\/dimacs\/049\/04"},{"key":"12_CR12","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. Fellows","year":"2003","unstructured":"Fellows, M.: Blow-ups, Win\/Wins 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":"12_CR13","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. Fellows","year":"2004","unstructured":"Fellows, M., Heggernes, P., Rosamond, F., 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":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-30140-0_29","volume-title":"Algorithms \u2013 ESA 2004","author":"M. Fellows","year":"2004","unstructured":"Fellows, M., Knauer, C., Nishimura, N., Radge, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 311\u2013322. Springer, Heidelberg (2004)"},{"key":"12_CR15","unstructured":"Fellows, M., Fernau, H., Langston, M., Prieto, E., Shaw, P., Symons, C., Stege, U.: The Graph Modification Problem: Edge Editing to k Cliques (manuscript in preparation)"},{"key":"12_CR16","unstructured":"Fellows, M., McCartin, C., Rosamond, F., Stege, U.: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. Foundations of Software Technology and Theoretical Computer Science (2000)"},{"key":"12_CR17","unstructured":"Fellows, M., Prieto, E., Sloper, C.: Looking at the Stars (manuscript in preparation)"},{"key":"12_CR18","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 J. Comput.\u00a010, 713\u2013717 (1981)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","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. Discret. Math.\u00a02(1), 68\u201372 (1989)","journal-title":"SIAM J. Discret. Math."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(94)90105-8","volume":"49","author":"V. Kann","year":"1994","unstructured":"Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters\u00a049, 309\u2013318 (1994)","journal-title":"Information Processing Letters"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-45078-8_41","volume-title":"Algorithms and Data Structures","author":"E. Prieto","year":"2003","unstructured":"Prieto, E., Sloper, C.: Either\/Or: Using Vertex Cover Structure in designing FPT-algorithms - the case of k-Internal Spanning Tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 474\u2013483. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:26:45Z","timestamp":1605760005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}