{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090306,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_37","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"501-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Planar Vertex-Disjoint Cycle Packing: New Structures and Improved Kernel"],"prefix":"10.1007","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Xiaolu","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Penninkx, E., Tan, R.B.: A linear kernel for the $$k$$-disjoint cycle problem on planar graphs. In: Proceedings of 19th International Symposium on Algorithms and Computation, pp. 306\u2013317 (2008)","DOI":"10.1007\/978-3-540-92182-0_29"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Kloks, T., Lee, C.M., Liu, J.: New algorithms for $$k$$-face cover, $$k$$-feedback vertex set, and $$k$$-disjoint cycles on plane and planar graphs. In: Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 282\u2013295 (2002)","DOI":"10.1007\/3-540-36379-3_25"},{"issue":"5","key":"37_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.jctb.2011.03.004","volume":"101","author":"N Kakimura","year":"2011","unstructured":"Kakimura, N., Kawarabayashi, K., Marx, D.: Packing cycles through prescribed vertices. J. Comb. Theor. Ser. B 101(5), 378\u2013381 (2011)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Grohe, M., Gr\u00fcber, M.: Parameterized approximability of the disjoint cycle problem. In: Proceedings of 34th International Colloquium on Automata, Languages and Programming, pp. 363\u2013374 (2007)","DOI":"10.1007\/978-3-540-73420-8_33"},{"issue":"35","key":"37_CR5","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Finding $$k$$ disjoint triangles in an arbitrary graph. In: Proceedings of 30th International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 235\u2013244 (2004)","DOI":"10.1007\/978-3-540-30559-0_20"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Guo, J., Niedermeier, R.: Linear problem kernels for NP-Hard problems on planar graphs. In: Proceedings of 34th International Colloquium on Automata, Languages and Programming, pp. 375\u2013386 (2007)","DOI":"10.1007\/978-3-540-73420-8_34"},{"key":"37_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"37_CR9","unstructured":"Agrawal, A., Lokshtanov, D., Majumdar, D., Mouawad, A.E., Saurabh, S.: Kernelization of cycle packing with relaxed disjointness constraints. In: Proceedings of 43rd International Colloquium on Automata, Languages, and Programming, pp. 26:1\u201326:14 (2016)"},{"issue":"4","key":"37_CR10","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1137\/120903518","volume":"27","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J. Discret. Math. 27(4), 2108\u20132142 (2013)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:14:21Z","timestamp":1709810061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}