{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:11Z","timestamp":1759638131740,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319784540"},{"type":"electronic","value":"9783319784557"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-78455-7_11","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"140-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Kernelization for $$P_2$$-Packing: A\u00a0Gerrymandering Approach"],"prefix":"10.1007","author":[{"given":"Wenjun","family":"Li","sequence":"first","affiliation":[]},{"given":"Junjie","family":"Ye","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-438X","authenticated-orcid":false,"given":"Yixin","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Chang, M.-S., Chen, L.-H., Hung, L.-J.: A $$5k$$ kernel for $$P_2$$-packing in net-free graphs. In: ICSEC 2014, pp. 12\u201317 (2014)","DOI":"10.1109\/ICSEC.2014.6978121"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-29700-7_19","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"J Chen","year":"2012","unstructured":"Chen, J., Fernau, H., Shaw, P., Wang, J., Yang, Z.: Kernels for packing and covering problems. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 199\u2013211. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_19"},{"key":"11_CR3","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":"MR Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-ups, win\/win\u2019s, and crown rules: some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1\u201312. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39890-5_1"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ 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. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T","volume":"36","author":"A Kaneko","year":"2001","unstructured":"Kaneko, A., Kelmans, A.K., Nishimura, T.: On packing 3-vertex paths in a graph. J. Graph Theory 36(4), 175\u2013197 (2001)","journal-title":"J. Graph Theory"},{"issue":"6","key":"11_CR8","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. Inf. Process. Lett. 49(6), 309\u2013318 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"11_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2010.05.001","volume":"159","author":"AK Kelmans","year":"2011","unstructured":"Kelmans, A.K.: Packing 3-vertex paths in claw-free graphs and related topics. Discret. Appl. Math. 159(2\u20133), 112\u2013127 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/jgt.10136","volume":"45","author":"AK Kelmans","year":"2004","unstructured":"Kelmans, A.K., Mubayi, D.: How many disjoint 2-edge paths must a cubic graph have? J. Graph Theory 45(1), 57\u201379 (2004)","journal-title":"J. Graph Theory"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM J. Comput. 12(3), 601\u2013609 (1983)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J Monnot","year":"2007","unstructured":"Monnot, J., Toulouse, S.: The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35(5), 677\u2013684 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E Prieto","year":"2006","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. Theor. Comput. Sci. 351(3), 437\u2013445 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2009.12.002","volume":"110","author":"J Wang","year":"2010","unstructured":"Wang, J., Ning, D., Feng, Q., Chen, J.: An improved kernelization for $$P_2$$-packing. Inf. Process. Lett. 110(5), 188\u2013192 (2010)","journal-title":"Inf. Process. Lett."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-319-55911-7_47","volume-title":"Theory and Applications of Models of Computation","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Kou, S.: Kernelization and parameterized algorithms for 3-path vertex cover. In: Gopal, T.V., J\u00e4ger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 654\u2013668. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55911-7_47"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T21:55:04Z","timestamp":1751493304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}