{"id":"https://openalex.org/W4281763199","doi":"https://doi.org/10.1145/3519935.3520021","title":"Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion","display_name":"Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281763199","doi":"https://doi.org/10.1145/3519935.3520021"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520021","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520021","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520021","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520021","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103139616","display_name":"Micha\u0142 W\u0142odarczyk","orcid":"https://orcid.org/0000-0003-0968-8414"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 W\u0142odarczyk","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048942396"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.1509,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.4812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"900","last_page":"913"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9628000259399414,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9584000110626221,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.7549647092819214},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7433772683143616},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6351680755615234},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6099251508712769},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.5652708411216736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5642743706703186},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5323840379714966},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.509316086769104},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4704170525074005},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44229185581207275},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3753734529018402},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.30889686942100525},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1342015564441681}],"concepts":[{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.7549647092819214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7433772683143616},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6351680755615234},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6099251508712769},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.5652708411216736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5642743706703186},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5323840379714966},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.509316086769104},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4704170525074005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44229185581207275},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3753734529018402},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.30889686942100525},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1342015564441681},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3519935.3520021","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520021","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520021","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/d85b991e-2086-48d2-8363-a35f051bb5bd","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/d85b991e-2086-48d2-8363-a35f051bb5bd","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jansen, B M P & W\u0142odarczyk, M 2022, Lossy planarization : a constant-factor approximate kernelization for planar vertex deletion. in S Leonardi & A Gupta (eds), STOC 2022 : Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., pp. 900-913, 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, Rome, Italy, 20/06/22. https://doi.org/10.1145/3519935.3520021","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3519935.3520021","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520021","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520021","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5036817778","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innov","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5399556803","display_name":null,"funder_award_id":"This project has received funding from the Europea","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8368575583","display_name":"Rigorous Search Space Reduction","funder_award_id":"803421","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8633428685","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innovat","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281763199.pdf","grobid_xml":"https://content.openalex.org/works/W4281763199.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W8067098","https://openalex.org/W174566906","https://openalex.org/W784404897","https://openalex.org/W1495415187","https://openalex.org/W1535967299","https://openalex.org/W1987374783","https://openalex.org/W1996472240","https://openalex.org/W1998964055","https://openalex.org/W2004181701","https://openalex.org/W2021903733","https://openalex.org/W2035409201","https://openalex.org/W2043644213","https://openalex.org/W2049637478","https://openalex.org/W2055789931","https://openalex.org/W2057826895","https://openalex.org/W2062599373","https://openalex.org/W2071321409","https://openalex.org/W2079577476","https://openalex.org/W2107284348","https://openalex.org/W2116087731","https://openalex.org/W2121655825","https://openalex.org/W2122043221","https://openalex.org/W2127485201","https://openalex.org/W2147929948","https://openalex.org/W2150855695","https://openalex.org/W2156760067","https://openalex.org/W2168568667","https://openalex.org/W2255673366","https://openalex.org/W2471129545","https://openalex.org/W2563156040","https://openalex.org/W2563767922","https://openalex.org/W2579312895","https://openalex.org/W2773937539","https://openalex.org/W2807573343","https://openalex.org/W2886408974","https://openalex.org/W2890355536","https://openalex.org/W2891457632","https://openalex.org/W2909144890","https://openalex.org/W2911549278","https://openalex.org/W2914414140","https://openalex.org/W2952680644","https://openalex.org/W2953105898","https://openalex.org/W2953115480","https://openalex.org/W2963513631","https://openalex.org/W2963874021","https://openalex.org/W2963901410","https://openalex.org/W2964006350","https://openalex.org/W2964099322","https://openalex.org/W2964266750","https://openalex.org/W2976369687","https://openalex.org/W2977752076","https://openalex.org/W3022690009","https://openalex.org/W3037133113","https://openalex.org/W3039254663","https://openalex.org/W3128925059","https://openalex.org/W3196355770","https://openalex.org/W4213262063","https://openalex.org/W4240592120","https://openalex.org/W4242090205","https://openalex.org/W6601211615"],"related_works":["https://openalex.org/W101378340","https://openalex.org/W2027513055","https://openalex.org/W2168711306","https://openalex.org/W2166871264","https://openalex.org/W2043560626","https://openalex.org/W1597649928","https://openalex.org/W3038050706","https://openalex.org/W2145388251","https://openalex.org/W3002469317","https://openalex.org/W4393300355"],"abstract_inverted_index":{"In":[0,49],"the":[1,13,30,50,63,75],"F-minor-free":[2,72],"deletion":[3,73],"problem":[4],"we":[5,53],"are":[6],"given":[7],"an":[8],"undirected":[9],"graph":[10,64],"G":[11],"and":[12,46],"goal":[14],"is":[15,67],"to":[16],"find":[17],"a":[18,56,68],"minimum":[19,57],"vertex":[20,42,58],"set":[21,59],"that":[22],"intersects":[23],"all":[24],"minor":[25],"models":[26],"of":[27,71],"graphs":[28],"from":[29],"family":[31,76],"F.":[32],"This":[33,66],"captures":[34],"numerous":[35],"important":[36],"problems":[37],"including":[38],"Vertex":[39,47],"cover,":[40],"Feedback":[41],"set,":[43],"Treewidth-\u03b7":[44],"modulator,":[45],"planarization.":[48],"latter":[51],"one,":[52],"ask":[54],"for":[55,74],"whose":[60],"removal":[61],"makes":[62],"planar.":[65],"special":[69],"case":[70],"F":[77],"=":[78],"{K5,":[79],"K3,3}.":[80]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}