{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:12:35Z","timestamp":1764785555417,"version":"3.33.0"},"reference-count":58,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["803421"],"award-info":[{"award-number":["803421"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2025,2,28]]},"DOI":"10.1137\/22m152058x","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T15:20:26Z","timestamp":1736781626000},"page":"1-91","source":"Crossref","is-referenced-by-count":1,"title":["Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion"],"prefix":"10.1137","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8204-1268","authenticated-orcid":true,"given":"Bart M. P.","family":"Jansen","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, Eindhoven, The Netherlands."}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0968-8414","authenticated-orcid":true,"given":"Micha\u0142","family":"W\u0142odarczyk","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland."}]}],"member":"351","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.10.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0443-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.04.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2973749"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9234-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00091"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0920"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2820609"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/14099228X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032077"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2020.09.010"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref20","series-title":"LIPIcs. Leibniz Int. Proc. Inform. 144","first-page":"37:1","volume-title":"Proceedings of the 27th Annual European Symposium on Algorithms","author":"Demaine E. D.","year":"2019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm033"},{"key":"ref22","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista G.","year":"1999"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/130927115"},{"key":"ref25","series-title":"LIPIcs. Leibniz Int. Proc. Inform. 83","first-page":"67:1","volume-title":"Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science","author":"Eiben E.","year":"2017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/18M1172508"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.4.634"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.03.021"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/05064299X"},{"key":"ref32","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin F.","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384318"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_25"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.007"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9627-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/17M112035X"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/20M1353782"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00592-7"},{"key":"ref48","volume":"113","author":"Kratsch S.","year":"2014","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3390887"},{"key":"ref50","doi-asserted-by":"crossref","unstructured":"S. Kreutzer and S. Tazari, On brambles, grid-like minors, and parameterized intractability of monadic second-order logic, in Proceedings of the 21stAnnual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2010, pp. 354\u2013364, https:\/\/doi.org\/10.1137\/1.9781611973075.30.","DOI":"10.1137\/1.9781611973075.30"},{"key":"ref51","series-title":"LIPIcs. Leibniz Int. Proc. Inform. 65","first-page":"23:1","volume-title":"Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","author":"Krithika R.","year":"2016"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.4064\/fm-28-1-22-32"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90060-4"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9484-z"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940648"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_527"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.56021\/9780801866890"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3239560"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.12.025"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.12.007"},{"key":"ref71","series-title":"Languages, and Programming, LIPIcs. Leibniz Int. Proc. Inform. 168","first-page":"95:1","volume-title":"Proceedings of the 47th International Colloquium on Automata","author":"Sau I.","year":"2020"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1993.1027"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215352"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1959-0101527-3"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9492-7"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1932-1501641-2"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T15:20:33Z","timestamp":1736781633000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M152058X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1137\/22M152058X"],"URL":"https:\/\/doi.org\/10.1137\/22m152058x","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,13]]}}}