{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:13Z","timestamp":1759638553988,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_527","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:04:09Z","timestamp":1461269049000},"page":"1033-1036","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Kernelization, Planar F-Deletion"],"prefix":"10.1007","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"733_CR1192","first-page":"19","volume":"1295","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender HL (1997) Treewidth: algorithmic techniques and results. In: 22nd international symposium on mathematical foundations of computer science (MFCS), Bratislava, vol\u00a01295, pp\u00a019\u201336","journal-title":"Bratislava, vol"},{"key":"733_CR1193","doi-asserted-by":"crossref","unstructured":"Bodlaender HL, Fomin FV, Lokshtanov D, Penninkx E, Saurabh S, Thilikos DM (2009) (Meta) kernelization. In: Proceedings of the 50th annual IEEE symposium on foundations of computer science (FOCS), Atlanta, pp\u00a0629\u2013638","DOI":"10.1109\/FOCS.2009.46"},{"issue":"3","key":"733_CR1194","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"MR Fellows","year":"1988","unstructured":"Fellows MR, Langston MA (1988) Nonconstructive tools for proving polynomial-time decidability. J ACM 35(3):727\u2013739","journal-title":"J ACM"},{"key":"733_CR1195","unstructured":"Fellows MR, Langston MA (1989) An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations (extended abstract). In: Proceedings of the 30th annual IEEE symposium on foundations of computer science (FOCS), Research Triangle Park, pp\u00a0520\u2013525"},{"key":"733_CR1196","doi-asserted-by":"crossref","unstructured":"Fomin FV, Lokshtanov D, Saurabh S, Thilikos DM (2010) Bidimensionality and kernels. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms (SODA), Austin, pp\u00a0503\u2013510","DOI":"10.1137\/1.9781611973075.43"},{"key":"733_CR1197","unstructured":"Fomin FV, Lokshtanov D, Misra N, Philip G, Saurabh S (2011) Hitting forbidden minors: approximation and kernelization. In: Proceedings of the 8th international symposium on theoretical aspects of computer science (STACS), LIPIcs, Dortmund, vol\u00a09, pp\u00a0189\u2013200"},{"key":"733_CR1198","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/1.9781611973082.59","volume-title":"Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms (SODA)","author":"FV Fomin","year":"2011","unstructured":"Fomin FV, Lokshtanov D, Raman V, Saurabh S (2011) Bidimensionality and EPTAS. In: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms (SODA), San Francisco. SIAM, pp\u00a0748\u2013759"},{"key":"733_CR1199","doi-asserted-by":"crossref","unstructured":"Fomin FV, Lokshtanov D, Misra N, Saurabh S (2012) Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: Proceedings of the 2012 IEEE 53rd annual symposium on foundations of computer science, New Brunswick, pp\u00a0470\u2013479","DOI":"10.1109\/FOCS.2012.62"},{"key":"733_CR11100","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1137\/1.9781611973099.124","volume-title":"Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms (SODA)","author":"FV Fomin","year":"2012","unstructured":"Fomin FV, Lokshtanov D, Saurabh S (2012) Bidimensionality and geometric graphs. In: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms (SODA), Kyoto. SIAM, pp\u00a01563\u20131575"},{"key":"733_CR11101","doi-asserted-by":"crossref","unstructured":"Jansen BMP, Lokshtanov D, Saurabh S (2014) A near-optimal planarization algorithm. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, (SODA), Portland, pp\u00a01802\u20131811","DOI":"10.1137\/1.9781611973402.130"},{"key":"733_CR11102","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/978-3-642-39206-1_52","volume-title":"Proceedings of the 40th international colloquium on automata, languages, and programming (ICALP), Riga, Part I","author":"EJ Kim","year":"2013","unstructured":"Kim EJ, Langer A, Paul C, Reidl F, Rossmanith P, Sau I, Sikdar S (2013) Linear kernels and single-exponential algorithms via protrusion decompositions. In: Proceedings of the 40th international colloquium on automata, languages, and programming (ICALP), Riga, Part I, pp\u00a0613\u2013624"},{"key":"733_CR11103","unstructured":"Langer A, Reidl F, Rossmanith P, Sikdar S (2012) Linear kernels on graphs excluding topological minors. CoRR abs\/1201.2780"},{"key":"733_CR11104","series-title":"and Marx, D\u00e1niel (eds) Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-30891-8_10","volume-title":"The multivariate algorithmic revolution and beyond. Bodlaender, HansL. and Downey, Rod and Fomin, FedorV","author":"D Lokshtanov","year":"2012","unstructured":"Lokshtanov D, Misra N, Saurabh S (2012) Kernelization \u2013 preprocessing with a guarantee. In: Bodlaender HL, Downey R, Fomin FV, Marx D (eds) The multivariate algorithmic revolution and beyond. Bodlaender, HansL. and Downey, Rod and Fomin, FedorV. and Marx, D\u00e1niel (eds) Lecture notes in computer science, vol\u00a07370. Springer, Berlin\/Heidelberg, pp\u00a0129\u2013161"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:46:56Z","timestamp":1553096816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_527","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}