{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:13:18Z","timestamp":1769512398374,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T00:00:00Z","timestamp":1386374400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9691-z","type":"journal-article","created":{"date-parts":[[2013,12,6]],"date-time":"2013-12-06T03:06:33Z","timestamp":1386299193000},"page":"125-140","source":"Crossref","is-referenced-by-count":19,"title":["Randomized parameterized algorithms for $$P_2$$ P 2 -Packing and Co-Path Packing problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shaohua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,7]]},"reference":[{"key":"9691_CR1","doi-asserted-by":"crossref","unstructured":"Chen Z, Fellows M, Fu B, Jiang H, Liu Y, Wang L, Zhu B (2010) A Linear Kernel for Co-Path\/cycle packing. In: 6th International conference on algorithmic aspects in information and management (AAIM 2010), LNCS, vol 6124, pp 90\u2013102","DOI":"10.1007\/978-3-642-14355-7_10"},{"issue":"4","key":"9691_CR2","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s00453-008-9206-y","volume":"54","author":"J Chen","year":"2008","unstructured":"Chen J, Lu S (2008) Improved parameterized set splitting algorithms: a probabilistic approach. Algorithmica 54(4):472\u2013489","journal-title":"Algorithmica"},{"key":"9691_CR3","unstructured":"Chen J, Lu S, Sze SH, Zhang F (2007) Improved algorithms for path, matching, and packing problems. Proc. of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA 07), pp 298\u2013307"},{"key":"9691_CR4","doi-asserted-by":"crossref","first-page":"e1000234","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C Chauve","year":"2008","unstructured":"Chauve C, Tannier E (2008) A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput Biol 4:e1000234","journal-title":"PLoS Comput Biol"},{"key":"9691_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K Bontridder De","year":"2003","unstructured":"De Bontridder K, Halld\u00f3rsson B, Lenstra J, Ravi R, Stougie L (2003) Approximation algorithms for the test cover problem. Math Program Ser B 98:477\u2013491","journal-title":"Math Program Ser B"},{"key":"9691_CR6","unstructured":"Fellows M, Heggernes P, Rosamond F, Sloper C, Telle JA (2004) Exact algorithms for finding $$k$$ k disjoint triangles in an arbitrary graph. In: Hromkovic J, Nagl M, Westfechtel B (eds) Proc. 30th workshop on graph theoretic concepts in computer science, LNCS, vol 3353. Springer, Heidelberg, pp 235\u2013244"},{"issue":"4","key":"9691_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10878-009-9230-0","volume":"18","author":"H Fernau","year":"2009","unstructured":"Fernau H, Raible D (2009) A parameterized perspective on packing paths of length two. J Comb Optim 18(4):319\u2013341","journal-title":"J Comb Optim"},{"key":"9691_CR8","unstructured":"Feng Q, Wang J, Chen J (2011) Matching and $$P_2$$ P 2 -Packing: weighted versions. In: 17th Annual international computing and combinatorics conference, LNCS, vol 6842, pp 343\u2013353"},{"key":"9691_CR9","doi-asserted-by":"crossref","first-page":"211227","DOI":"10.1006\/jagm.1998.0995","volume":"31","author":"T Fujito","year":"1999","unstructured":"Fujito T (1999) Approximating node-deletion problems for matroidal properties. J Algorithms 31:211227","journal-title":"J Algorithms"},{"key":"9691_CR10","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1016\/j.dam.2005.11.003","volume":"154","author":"R Hassin","year":"2006","unstructured":"Hassin R, Rubinstein S (2006) An approximation algorithm for maximum triangle packing. Discret Appl Math 154:971\u2013979","journal-title":"Discret Appl Math"},{"key":"9691_CR11","doi-asserted-by":"crossref","unstructured":"Marx D, Razgon I (2011) Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proceedings of the 43rd annual ACM symposium on theory of computing (STOC 2011), pp 469\u2013478","DOI":"10.1145\/1993636.1993699"},{"key":"9691_CR12","doi-asserted-by":"crossref","unstructured":"Marx D (2012) Randomized techniques for parameterized algorithms. In Proceedings of the 7th international symposium on parameterized and exact computation (IPEC 2012), LNCS vol 7535, p 2","DOI":"10.1007\/978-3-642-33293-7_2"},{"key":"9691_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E Prieto","year":"2006","unstructured":"Prieto E, Sloper C (2006) Looking at the stars. Theor Comput Sci 351:437\u2013445","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9691-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9691-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9691-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T11:03:55Z","timestamp":1564916635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9691-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9691"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9691-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,7]]}}}