{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T02:03:56Z","timestamp":1769738636177,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642143540","type":"print"},{"value":"9783642143557","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_10","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T13:34:40Z","timestamp":1277300080000},"page":"90-102","source":"Crossref","is-referenced-by-count":10,"title":["A Linear Kernel for Co-Path\/Cycle Packing"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"F.N. Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory Comput. Syst.\u00a041(3), 411\u2013430 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. J. Algorithms\u00a041(2), 280\u2013301 (2001)","journal-title":"J. Algorithms"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1000234","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C. Chauve","year":"2008","unstructured":"Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol.\u00a04, e1000234 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jagm.1998.0995","volume":"31","author":"T. Fujito","year":"1999","unstructured":"Fujito, T.: Approximating node-deletion problems for matroidal properties. J. Algorithms\u00a031, 211\u2013227 (1999)","journal-title":"J. Algorithms"},{"key":"10_CR6","unstructured":"Fellows, M., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhausser and Trotter\u2019s local optimization theorem. In: Proc.\u00a0STACS 2009, pp. 409\u2013420 (2009)"},{"key":"10_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Fernau, H., Raible, D.: Search trees: an essay. In: Proc.\u00a0TAMC 2009, pp. 59\u201370 (2009)","DOI":"10.1007\/978-3-642-02017-9_9"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-642-13509-5_11","volume-title":"CPM 2010","author":"H. Jiang","year":"2010","unstructured":"Jiang, H., Chauve, C., Zhu, B.: Breakpoint distance and PQ-trees. In: Javed, A. (ed.) CPM 2010. LNCS, vol.\u00a06129, pp. 112\u2013124. Springer, Heidelberg (2010)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03b5. J. Comput. System Sci.\u00a074, 335\u2013349 (2008)","journal-title":"J. Comput. System Sci."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J. Lewis","year":"1980","unstructured":"Lewis, J., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci.\u00a020, 425\u2013440 (1980)","journal-title":"J. Comput. System Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E. Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics\u00a010, 120 (2009)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:31Z","timestamp":1606186291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}