{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:05:51Z","timestamp":1743030351803,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"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_13","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"169-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Kernels for Several Problems on Planar Graphs"],"prefix":"10.1007","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Beilin","family":"Zhuo","sequence":"additional","affiliation":[]},{"given":"Guanlan","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Neng","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J Alber","year":"2004","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363\u2013384 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0095-8956(03)00036-4","volume":"88","author":"N Alon","year":"2003","unstructured":"Alon, N., Bollob\u00e1s, B., Krivelevich, M., Sudakov, B.: Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory, Ser. B 88(2), 329\u2013346 (2003)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1002\/jgt.20346","volume":"60","author":"OV Borodin","year":"2009","unstructured":"Borodin, O.V., Kostochka, A.V., Sheikh, N.N., Yu, G.: M-degrees of quadrangle-free planar graphs. J. Graph Theory 60(1), 80\u201385 (2009)","journal-title":"J. Graph Theory"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.endm.2009.02.008","volume":"32","author":"D Br\u00fcgmann","year":"2009","unstructured":"Br\u00fcgmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electron. Notes Discret. Math. 32, 51\u201358 (2009)","journal-title":"Electron. Notes Discret. Math."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron, K.: Induced matchings. Discret. Appl. Math. 24, 97\u2013102 (1989)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2003.05.001","volume":"278","author":"K Cameron","year":"2004","unstructured":"Cameron, K.: Induced matchings in intersection graphs. Discret. Math. 278(1\u20133), 1\u20139 (2004)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"13_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K Cameron","year":"2003","unstructured":"Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266(1\u20133), 133\u2013142 (2003)","journal-title":"Discret. Math."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-30140-0_19","volume-title":"Algorithms \u2013 ESA 2004","author":"M Chleb\u00edk","year":"2004","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 192\u2013203. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_19"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2004.05.001","volume":"3","author":"W Duckworth","year":"2005","unstructured":"Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discret. Algorithms 3(1), 79\u201391 (2005)","journal-title":"J. Discret. Algorithms"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2010.08.026","volume":"158","author":"R Erman","year":"2010","unstructured":"Erman, R., Kowalik, \u0141., Krnc, M., Wale\u0144, T.: Improved induced matchings in sparse graphs. Discret. Appl. Math. 158, 1994\u20132003 (2010)","journal-title":"Discret. Appl. Math."},{"key":"13_CR11","first-page":"239","volume":"89","author":"G Fricke","year":"1992","unstructured":"Fricke, G., Laskar, R.: String matching in trees. Congr. Numer. 89, 239\u2013243 (1992)","journal-title":"Congr. Numer."},{"issue":"1\u20133","key":"13_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"MC Golumbic","year":"2000","unstructured":"Golumbic, M.C., Lewenstein, M.: New results on induced matchings. Discret. Appl. Math. 101(1\u20133), 157\u2013165 (2000)","journal-title":"Discret. Appl. Math."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11671411_21","volume-title":"Approximation and Online Algorithms","author":"Z Gotthilf","year":"2006","unstructured":"Gotthilf, Z., Lewenstein, M.: Tighter approximations for maximum induced matchings in regular graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 270\u2013281. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_21"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-73420-8_34","volume-title":"Automata, Languages and Programming","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Linear problem kernels for NP-Hard problems on planar graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375\u2013386. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_34"},{"issue":"9","key":"13_CR15","doi-asserted-by":"publisher","first-page":"4219","DOI":"10.1109\/TIT.2006.880060","volume":"52","author":"TR Halford","year":"2006","unstructured":"Halford, T.R., Grant, A.J., Chugg, K.M.: Which codes have 4-cycle-free tanner graphs. IEEE Trans. Inf. Theory 52(9), 4219\u20134223 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"13_CR16","first-page":"79","volume":"44","author":"P Heggernes","year":"1993","unstructured":"Heggernes, P., Hof, P.V., Lokshtanov, D., Paul, C.: Irredundancy in circular arc graphs. Discret. Appl. Math. 44(1\u20133), 79\u201389 (1993)","journal-title":"Discret. Appl. Math."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2016.06.001","volume":"640","author":"M Jiang","year":"2016","unstructured":"Jiang, M., Xia, G., Zhang, Y.: Edge-disjoint packing of stars and cycles. Theor. Comput. Sci. 640, 61\u201369 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1016\/j.jcss.2010.09.001","volume":"77","author":"I Kanj","year":"2011","unstructured":"Kanj, I., Pelsmajer, M.J., Schaefer, M., Xia, G.: On the induced matching problem. J. Comput. Syst. Sci. 77, 1058\u20131070 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00453-003-1035-4","volume":"37","author":"D Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Finding maximum induced matchings in subclasses of claw-free and $$P_5$$-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica 37(4), 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-85363-3_10","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"G Kortsarz","year":"2008","unstructured":"Kortsarz, G., Langberg, M., Nutov, Z.: Approximating maximum subgraphs without short cycles. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM-2008. LNCS, vol. 5171, pp. 118\u2013131. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_10"},{"issue":"1\u20133","key":"13_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(93)00228-W","volume":"142","author":"M Krivelevich","year":"1995","unstructured":"Krivelevich, M.: On a conjecture of Tuza about packing and covering of triangles. Discret. Math. 142(1\u20133), 281\u2013286 (1995)","journal-title":"Discret. Math."},{"key":"13_CR22","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North Holland, Amsterdam (1986)"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"VV Lozin","year":"2002","unstructured":"Lozin, V.V.: On maximum induced matchings in bipartite graphs. Inf. Process. Lett. 81(1), 7\u201311 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2003.07.004","volume":"88","author":"VV Lozin","year":"2003","unstructured":"Lozin, V.V., Rautenbach, D.: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4), 167\u2013171 (2003)","journal-title":"Inf. Process. Lett."},{"key":"13_CR25","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. In: Proceedings of the Second Workshop on Algorithms and Complexity in Durham, pp. 107\u2013118 (2006)"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.dam.2008.07.011","volume":"157","author":"H Moser","year":"2009","unstructured":"Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discret. Appl. Math. 157, 715\u2013727 (2009)","journal-title":"Discret. Appl. Math."},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.disopt.2007.11.010","volume":"5","author":"Y Orlovich","year":"2008","unstructured":"Orlovich, Y., Finke, G., Gordon, V., Zverovich, I.: Approximability results for the maximum and minimum maximal induced matching problems. Discret. Optim. 5, 584\u2013593 (2008)","journal-title":"Discret. Optim."},{"issue":"9","key":"13_CR28","doi-asserted-by":"publisher","first-page":"1786","DOI":"10.1101\/gr.2395204","volume":"14","author":"P Pevzner","year":"2004","unstructured":"Pevzner, P., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. Genome Res. 14(9), 1786\u20131796 (2004)","journal-title":"Genome Res."},{"issue":"1","key":"13_CR29","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"LJ Stockmeyer","year":"1982","unstructured":"Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett. 15(1), 14\u201319 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"13_CR30","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00493-002-0009-5","volume":"22","author":"C Thomassen","year":"2002","unstructured":"Thomassen, C.: On the chromatic number of triangle-free graphs of large minimum degree. Combinatorica 22(4), 591\u2013596 (2002)","journal-title":"Combinatorica"},{"issue":"2","key":"13_CR31","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00493-007-0054-1","volume":"27","author":"C Thomassen","year":"2007","unstructured":"Thomassen, C.: On the chromatic number of pentagon-free graphs of large minimum degree. Combinatorica 27(2), 241\u2013243 (2007)","journal-title":"Combinatorica"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, Y.: Kernelization for cycle transversal problems. In: Proceedings of AAIM, pp. 293\u2013303 (2010)","DOI":"10.1007\/978-3-642-14355-7_30"},{"issue":"29","key":"13_CR33","doi-asserted-by":"publisher","first-page":"3501","DOI":"10.1016\/j.tcs.2011.02.040","volume":"412","author":"G Xia","year":"2011","unstructured":"Xia, G., Zhang, Y.: On the small cycle transversal of planar graphs. Theor. Comput. Sci. 412(29), 3501\u20133509 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of STOC, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"issue":"1\u20133","key":"13_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2008.04.018","volume":"407","author":"J Zhu","year":"2008","unstructured":"Zhu, J., Bu, Y.: Equitable list colorings of planar graphs without short cycles. Theor. Comput. Sci. 407(1\u20133), 21\u201328 (2008)","journal-title":"Theor. Comput. Sci."}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:48Z","timestamp":1709810988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_13","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"}}]}}