{"id":"https://openalex.org/W3116379639","doi":"https://doi.org/10.1137/16m1080264","title":"Bidimensionality and Kernels","display_name":"Bidimensionality and Kernels","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3116379639","doi":"https://doi.org/10.1137/16m1080264","mag":"3116379639"},"language":"en","primary_location":{"id":"doi:10.1137/16m1080264","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1080264","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://hal.science/hal-03094544","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics [Bergen]"],"raw_orcid":"https://orcid.org/0000-0003-1955-4612","affiliations":[{"raw_affiliation_string":"Department of Informatics [Bergen]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Computer Science [Santa Barbara]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science [Santa Barbara]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"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"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences [Chennai]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences [Chennai]","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":"https://orcid.org/0000-0003-0470-1800"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["Algorithmes, Graphes et Combinatoire"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmes, Graphes et Combinatoire","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6907,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77318841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"49","issue":"6","first_page":"1397","last_page":"1422"},"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.9988999962806702,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9957000017166138,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7960801124572754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7413648962974548},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.6622747182846069},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6217584609985352},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5786690711975098},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4797971546649933},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4554050862789154},{"id":"https://openalex.org/keywords/graph-minor","display_name":"Graph minor","score":0.43163472414016724},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.41040733456611633},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4009816348552704},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.36971789598464966},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1293918490409851},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.09841743111610413}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7960801124572754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7413648962974548},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.6622747182846069},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6217584609985352},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5786690711975098},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4797971546649933},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4554050862789154},{"id":"https://openalex.org/C140752511","wikidata":"https://www.wikidata.org/wiki/Q905837","display_name":"Graph minor","level":5,"score":0.43163472414016724},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.41040733456611633},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4009816348552704},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.36971789598464966},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1293918490409851},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.09841743111610413},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1080264","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1080264","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:HAL:hal-03094544v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03094544","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03094544v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03094544","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1535968106","display_name":"Efficiency and Structure in Graph Mining Applications","funder_award_id":"ANR-17-CE23-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5140280351","display_name":"Decomposition of Graphical Models","funder_award_id":"ANR-16-CE40-0028","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5732392639","display_name":"Parameterized Approximation","funder_award_id":"306992","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G5860854717","display_name":"RIGOROUS THEORY OF PREPROCESSING","funder_award_id":"267959","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1838629830","https://openalex.org/W1964699377","https://openalex.org/W1971799322","https://openalex.org/W1973347908","https://openalex.org/W1974810008","https://openalex.org/W1976463682","https://openalex.org/W1978452004","https://openalex.org/W1982180670","https://openalex.org/W1983860528","https://openalex.org/W2002722727","https://openalex.org/W2007069176","https://openalex.org/W2008440715","https://openalex.org/W2012313040","https://openalex.org/W2026771935","https://openalex.org/W2028357390","https://openalex.org/W2031042330","https://openalex.org/W2032762881","https://openalex.org/W2038643780","https://openalex.org/W2057826895","https://openalex.org/W2064796716","https://openalex.org/W2083748805","https://openalex.org/W2087083200","https://openalex.org/W2093762675","https://openalex.org/W2108093643","https://openalex.org/W2127485201","https://openalex.org/W2145062394","https://openalex.org/W2158584754","https://openalex.org/W2196420389","https://openalex.org/W2538886279","https://openalex.org/W2563156040","https://openalex.org/W2785736399","https://openalex.org/W2810074797","https://openalex.org/W2913492813"],"related_works":["https://openalex.org/W2113684989","https://openalex.org/W1511821218","https://openalex.org/W4389814085","https://openalex.org/W4285659194","https://openalex.org/W2012687409","https://openalex.org/W1976463682","https://openalex.org/W1585579706","https://openalex.org/W1520984708","https://openalex.org/W2778851403","https://openalex.org/W1649387244"],"abstract_inverted_index":{"Bidimensionality":[0],"theory":[1,61,87],"was":[2,62],"introduced":[3],"by":[4,88],"[E.":[5,29],"D.":[6,30],"Demaine":[7,31],"et":[8],"al.,":[9],"J.":[10],"ACM,":[11],"52":[12],"(2005),":[13],"pp.":[14,58],"866--893]":[15],"as":[16,144],"a":[17,81,113,127,136,145,151],"tool":[18],"to":[19,66,91,178],"obtain":[20,67],"subexponential":[21],"time":[22,69],"parameterized":[23,98],"algorithms":[24,40],"on":[25,51,159,172],"H-minor-free":[26,173],"graphs.":[27],"In":[28,76,100],"and":[32,41,116],"M.":[33],"Hajiaghayi,":[34],"Bidimensionality:":[35],"New":[36],"connections":[37],"between":[38],"FPT":[39],"PTASs,":[42],"in":[43,64,119],"Proceedings":[44],"of":[45,94,132,153,166],"the":[46,92,160],"16th":[47],"Annual":[48],"ACM-SIAM":[49],"Symposium":[50],"Discrete":[52],"Algorithms":[53],"(SODA),":[54],"SIAM,":[55],"Philadelphia,":[56],"2005,":[57],"590--601]":[59],"this":[60,77],"extended":[63],"order":[65],"polynomial":[68,170],"approximation":[70],"schemes":[71],"(PTASs)":[72],"for":[73,85,97,130],"bidimensional":[74,109,154],"problems.":[75,99],"work,":[78],"we":[79,102],"establish":[80],"third":[82],"meta-algorithmic":[83],"direction":[84],"bidimensionality":[86],"relating":[89],"it":[90],"existence":[93],"linear":[95,128,157],"kernels":[96,158,171],"particular,":[101],"prove":[103],"that":[104,111,134,150],"every":[105],"minor":[106],"(resp.,":[107,139],"contraction)":[108],"problem":[110],"satisfies":[112],"separation":[114],"property":[115],"is":[117],"expressible":[118],"Countable":[120],"Monadic":[121],"Second":[122],"Order":[123],"Logic":[124],"(CMSO)":[125],"admits":[126],"kernel":[129],"classes":[131],"graphs":[133,174],"exclude":[135],"fixed":[137],"graph":[138,162],"an":[140],"apex":[141],"graph)":[142],"H":[143],"minor.":[146],"Our":[147],"results":[148],"imply":[149],"multitude":[152],"problems":[155,168],"admit":[156],"corresponding":[161],"classes.":[163],"For":[164],"most":[165],"these":[167],"no":[169],"were":[175],"known":[176],"prior":[177],"our":[179],"work.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}