{"id":"https://openalex.org/W2338323869","doi":"https://doi.org/10.1137/19m1262504","title":"Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering","display_name":"Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering","publication_year":2022,"publication_date":"2022-12-16","ids":{"openalex":"https://openalex.org/W2338323869","doi":"https://doi.org/10.1137/19m1262504","mag":"2338323869"},"language":"en","primary_location":{"id":"doi:10.1137/19m1262504","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1262504","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.sztaki.hu/9045/1/Fomin_515_3174174_ny.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA 93106-5110 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA 93106-5110 USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarland Informatics Campus, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarland Informatics Campus, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai 600 113, India, and Department of Informatics, University of Bergen, N-5020 Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai 600 113, India, and Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I59611059","https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":1.2069,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.8034844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"51","issue":"6","first_page":"1866","last_page":"1930"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/treewidth","display_name":"Treewidth","score":0.7921872138977051},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7544318437576294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6602288484573364},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5284079313278198},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5275207161903381},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5157063603401184},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4989759922027588},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4740592837333679},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4737209379673004},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.46391430497169495},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4397132992744446},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4158720076084137},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.3714812695980072},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.32249951362609863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2524241805076599},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12615618109703064}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7921872138977051},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7544318437576294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6602288484573364},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5284079313278198},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5275207161903381},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5157063603401184},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4989759922027588},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4740592837333679},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4737209379673004},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.46391430497169495},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4397132992744446},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4158720076084137},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3714812695980072},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32249951362609863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2524241805076599},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12615618109703064}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/19m1262504","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1262504","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:eprints.sztaki.hu:9045","is_oa":true,"landing_page_url":"http://eprints.sztaki.hu/9045/","pdf_url":"https://eprints.sztaki.hu/9045/1/Fomin_515_3174174_ny.pdf","source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":{"id":"pmh:oai:eprints.sztaki.hu:9045","is_oa":true,"landing_page_url":"http://eprints.sztaki.hu/9045/","pdf_url":"https://eprints.sztaki.hu/9045/1/Fomin_515_3174174_ny.pdf","source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G216536116","display_name":null,"funder_award_id":"UMO-2013/09/B/ST6/03136","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G3211800559","display_name":null,"funder_award_id":"306992","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G5539758277","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G72107327","display_name":null,"funder_award_id":"267959","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7324173974","display_name":null,"funder_award_id":"NK105645","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"},{"id":"https://openalex.org/G7723633313","display_name":null,"funder_award_id":"UMO-2013/11/D/ST6/03073","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G7971188028","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320333065","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320333065","display_name":"Seventh Framework Programme","ror":null},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2338323869.pdf"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W28674990","https://openalex.org/W1512232443","https://openalex.org/W1533217239","https://openalex.org/W1966397930","https://openalex.org/W1976463682","https://openalex.org/W1982180670","https://openalex.org/W1983156760","https://openalex.org/W1985572324","https://openalex.org/W1987776185","https://openalex.org/W1998544343","https://openalex.org/W2002722727","https://openalex.org/W2003272551","https://openalex.org/W2005079828","https://openalex.org/W2007069176","https://openalex.org/W2013522700","https://openalex.org/W2015321560","https://openalex.org/W2016465035","https://openalex.org/W2067431706","https://openalex.org/W2076043677","https://openalex.org/W2076164610","https://openalex.org/W2092904196","https://openalex.org/W2127485201","https://openalex.org/W2129939288","https://openalex.org/W2154257711","https://openalex.org/W2158584754","https://openalex.org/W2165930352","https://openalex.org/W2180988813","https://openalex.org/W2296148711","https://openalex.org/W2350783824","https://openalex.org/W2890355536","https://openalex.org/W2913492813","https://openalex.org/W2914414140","https://openalex.org/W2963838695","https://openalex.org/W3139078859","https://openalex.org/W4226434845","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W1976784955","https://openalex.org/W101378340","https://openalex.org/W1588220234","https://openalex.org/W1667353902","https://openalex.org/W2027513055","https://openalex.org/W1486147625","https://openalex.org/W1585579706","https://openalex.org/W4252949575","https://openalex.org/W2031276298"],"abstract_inverted_index":{".We":[0],"prove":[1],"the":[2,32,59,64,80,195],"following":[3,33],"theorem.":[4],"Given":[5],"a":[6,24,37,101,136,141,145,214,219],"planar":[7,113,187],"graph":[8,217],"\\(G\\)":[9,30,40,53,85],"and":[10,46,164],"an":[11],"integer":[12],"\\(k\\)":[13,57,155,158],",":[14,45,76],"it":[15,173],"is":[16,70,79],"possible":[17],"in":[18,144,182,205,221,226],"polynomial":[19],"time":[20,118,185],"to":[21,130,170,194],"randomly":[22],"sample":[23],"subset":[25],"\\(A\\)":[26,35,62],"of":[27,29,39,41,52,68,82,84,95,150,198,210],"vertices":[28,83],"with":[31,88,116,140],"properties:":[34],"induces":[36],"subgraph":[38,50],"treewidth":[42],"\\({\\mathcal{O}}(\\sqrt{k}\\log":[43],"k)\\)":[44],"for":[47,93,104,110,135],"every":[48],"connected":[49,138],"\\(H\\)":[51,69],"on":[54,112,186,207,223],"at":[55,71],"most":[56],"vertices,":[58],"probability":[60],"that":[61,212],"covers":[63],"whole":[65],"vertex":[66],"set":[67],"least":[72],"\\((2^{{\\mathcal{O}}(\\sqrt{k}\\log^2":[73],"k)}\\!\\cdot":[74],"n^{{\\mathcal{O}}(1)})^{-1}\\)":[75],"where":[77],"\\(n\\)":[78],"number":[81],".":[86,124],"Together":[87],"standard":[89],"dynamic":[90],"programming":[91],"techniques":[92],"graphs":[94,211,224],"bounded":[96],"treewidth,":[97],"this":[98,171],"result":[99],"gives":[100],"versatile":[102],"technique":[103,126,197],"obtaining":[105],"(randomized)":[106],"subexponential-time":[107],"parameterized":[108,184],"algorithms":[109],"problems":[111,131,152,178],"graphs,":[114,188],"usually":[115],"running":[117],"bound":[119],"\\(2^{{\\mathcal{O}}(\\sqrt{k}":[120],"\\log^2":[121],"k)}":[122],"n^{{\\mathcal{O}}(1)}\\)":[123],"The":[125],"can":[127],"be":[128,180],"applied":[129],"expressible":[132],"as":[133,218],"searching":[134],"small,":[137],"pattern":[139],"prescribed":[142],"property":[143],"large":[146],"host":[147],"graph;":[148],"examples":[149],"such":[151],"include":[153],"Directed":[154],"-Path,":[156,159],"Weighted":[157],"Vertex":[160],"Cover":[161],"Local":[162],"Search,":[163],"Subgraph":[165],"Isomorphism,":[166],"among":[167],"others.":[168],"Up":[169],"point,":[172],"was":[174],"open":[175],"whether":[176],"these":[177],"could":[179],"solved":[181],"subexponential":[183],"because":[189],"they":[190],"are":[191],"not":[192],"amenable":[193],"classic":[196],"bidimensionality.":[199],"Furthermore,":[200],"all":[201],"our":[202],"results":[203],"hold":[204],"fact":[206],"any":[208,227],"class":[209],"exclude":[213],"fixed":[215,228],"apex":[216],"minor,":[220],"particular":[222],"embeddable":[225],"surface.Keywordsparameterized":[229],"complexitysubexponential":[230],"algorithmstreewidthplanar":[231],"graphssubgraph":[232],"isomorphismMSC":[233],"codes05C7505C8568R10":[234]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}
