{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:07Z","timestamp":1725516607203},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_6","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T03:18:26Z","timestamp":1219115906000},"page":"54-63","source":"Crossref","is-referenced-by-count":3,"title":["A Parameterized Perspective on Packing Paths of Length Two"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Raible","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K.M.J. Bontridder De","year":"2003","unstructured":"De Bontridder, K.M.J., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Progr. Ser. B\u00a098, 477\u2013491 (2003)","journal-title":"Math. Progr. Ser. B"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1137\/050646354","volume":"37","author":"J. Chen","year":"2007","unstructured":"Chen, J., Fernau, H., Kanj, Y.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM Journal on Computing\u00a037, 1077\u20131108 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR3","first-page":"298","volume-title":"Symposium on Discrete Algorithms SODA","author":"J. Chen","year":"2007","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Symposium on Discrete Algorithms SODA, pp. 298\u2013307. SIAM, Philadelphia (2007)"},{"key":"6_CR4","first-page":"1","volume":"1","author":"C. Cotta","year":"2002","unstructured":"Cotta, C., Moscato, P.: On the parameterized complextiy of problems related with feature identification for gene expression data mining techniques. Bioinformatics\u00a01, 1\u20138 (2002)","journal-title":"Bioinformatics"},{"key":"6_CR5","unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-time extremal structure I. In: Broersma, H., Johnson, M., Szeider, S. (eds.) Algorithms and Complexity in Durham ACiD 2005. Texts in Algorithmics, vol.\u00a04, pp. 1\u201341. King\u2019s College Publications (2005)"},{"key":"6_CR6","first-page":"69","volume-title":"Algorithms and Complexity in Durham ACiD 2006","author":"H. Fernau","year":"2006","unstructured":"Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: Complexity and algorithms. In: Algorithms and Complexity in Durham ACiD 2006, pp. 69\u201384. King\u2019s College, London (2006)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(97)00097-5","volume":"63","author":"R. Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum of 3-edge paths. Information Processing Letters\u00a063, 63\u201367 (1997)","journal-title":"Information Processing Letters"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.dam.2005.11.003","volume":"154","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics\u00a0154, 971\u2013979; 2620 [Erratum] (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR9","unstructured":"Hell, P., Kirkpatrick, D.G.: Star factors and star packings. Technical Report 82-6, Computing Science, Simon Fraser University, Burnaby, B.C. V5A1S6, Canada (1982)"},{"key":"6_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, 106\u2013117 (2004)","journal-title":"Journal of Algorithms"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: ACM Symposium on Theory of Computing STOC, pp. 240\u2013245 (1978)","DOI":"10.1145\/800133.804353"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11847250_8","volume-title":"Parameterized and Exact Computation","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Lu, S., Chen, J., Sze, S.-H.: Greedy localization and color-coding: improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 84\u201395. Springer, Heidelberg (2006)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-540-28639-4_13","volume-title":"Parameterized and Exact Computation","author":"E. Prieto","year":"2004","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 138\u2013148. Springer, Heidelberg (2004)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-79228-4_7","volume-title":"Theory and Applications of Models of Computation TAMC","author":"J. Wang","year":"2008","unstructured":"Wang, J., Feng, Q.: An O *(3.523k ) parameterized algorithm for 3-set packing. In: Agrawal, M., et al. (eds.) Theory and Applications of Models of Computation TAMC. LNCS, vol.\u00a04978, pp. 82\u201393. Springer, Heidelberg (2008)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","first-page":"212","volume-title":"TAMC 2008","author":"J. Wang","year":"2008","unstructured":"Wang, J., Ning, D., Feng, Q., Chen, J.: An improved parameterized algorithm for a generalized matching problem. In: Agrawal, M., Du., D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 212\u2013222. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:21:56Z","timestamp":1606166516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}