{"id":"https://openalex.org/W2800485060","doi":"https://doi.org/10.1145/3170442","title":"Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal","display_name":"Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal","publication_year":2018,"publication_date":"2018-04-16","ids":{"openalex":"https://openalex.org/W2800485060","doi":"https://doi.org/10.1145/3170442","mag":"2800485060"},"language":"en","primary_location":{"id":"doi:10.1145/3170442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3170442","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"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":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway, Bergen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway, Bergen","institution_ids":["https://openalex.org/I4432739"]}]},{"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/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"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/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":["The Institute of Mathematical Sciences, Taramani, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, Taramani, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7689,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.96755983,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"14","issue":"2","first_page":"1","last_page":"30"},"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8853291273117065},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.8503202199935913},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7452042698860168},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.7385456562042236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6618199944496155},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6406367421150208},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5519022941589355},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5404303073883057},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47087347507476807},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4283643960952759},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4162192940711975},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41200053691864014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34008848667144775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33050960302352905},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15662384033203125}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8853291273117065},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.8503202199935913},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7452042698860168},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.7385456562042236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6618199944496155},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6406367421150208},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5519022941589355},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5404303073883057},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47087347507476807},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4283643960952759},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4162192940711975},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41200053691864014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34008848667144775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33050960302352905},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15662384033203125},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3170442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3170442","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1565709240","https://openalex.org/W1566367487","https://openalex.org/W1576180980","https://openalex.org/W1579510955","https://openalex.org/W1580414818","https://openalex.org/W1787126581","https://openalex.org/W1804016314","https://openalex.org/W1968952709","https://openalex.org/W1973046087","https://openalex.org/W1985572324","https://openalex.org/W1991223992","https://openalex.org/W1995725694","https://openalex.org/W1999145171","https://openalex.org/W2010651583","https://openalex.org/W2012948111","https://openalex.org/W2018669365","https://openalex.org/W2041837101","https://openalex.org/W2045326192","https://openalex.org/W2047489708","https://openalex.org/W2055693471","https://openalex.org/W2059273723","https://openalex.org/W2067431706","https://openalex.org/W2076461672","https://openalex.org/W2083103669","https://openalex.org/W2127485201","https://openalex.org/W2130190334","https://openalex.org/W2136595209","https://openalex.org/W2146507303","https://openalex.org/W2150004999","https://openalex.org/W2154399201","https://openalex.org/W2158584754","https://openalex.org/W2162561603","https://openalex.org/W2180988813","https://openalex.org/W2207058206","https://openalex.org/W2250978763","https://openalex.org/W2252464404","https://openalex.org/W2256089709","https://openalex.org/W2261299644","https://openalex.org/W2398655357","https://openalex.org/W2404960361","https://openalex.org/W2490706771","https://openalex.org/W2496893526","https://openalex.org/W2550548770","https://openalex.org/W2570206580","https://openalex.org/W2580171847","https://openalex.org/W2963260267","https://openalex.org/W2963908100","https://openalex.org/W2964157411","https://openalex.org/W3139078859","https://openalex.org/W4210733105","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W2800485060","https://openalex.org/W1787126581","https://openalex.org/W4302768721","https://openalex.org/W1584965761","https://openalex.org/W2951007762","https://openalex.org/W2113270940","https://openalex.org/W2583459474","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4389820491"],"abstract_inverted_index":{"We":[0,20],"obtain":[1],"a":[2],"number":[3],"of":[4,11,17,30],"lower":[5,208],"bounds":[6,209],"on":[7,15],"the":[8,22,25,211,215,220,224,227],"running":[9,212],"time":[10,47,71,93,115,139,166,193],"algorithms":[12,218],"solving":[13],"problems":[14],"graphs":[16],"bounded":[18],"treewidth.":[19],"prove":[21],"results":[23],"under":[24],"Strong":[26],"Exponential":[27],"Time":[28],"Hypothesis":[29],"Impagliazzo":[31],"and":[32],"Paturi.":[33],"In":[34],"particular,":[35],"assuming":[36],"that":[37,56],"n":[38,49],"-variable":[39],"m":[40,50],"-clause":[41],"SAT":[42],"cannot":[43,67,89,111,135,162,189],"be":[44,68,90,112,136,163,190],"solved":[45,69,91,113,137,164,191],"in":[46,70,92,114,138,165,192,226],"(2-\u03f5)":[48,72,116,194],"O":[51,81,103,125,129,149,179,204],"(1)":[52,82,104,126,150,180,205],",":[53,83,105,127,151,181],"we":[54],"show":[55],"for":[57,214,219],"any":[58,154],"\u03f5":[59,225],">":[60],"0:":[61],"\u2022":[62,84,106,128,152,182],"I":[63,185],"ndependent":[64],"S":[65,87],"et":[66,88],"tw(":[73,95,117,141],"G":[74,79,96,101,118,123,142,147,172,177,197,202],")":[75,97,119,143,173,198],"|":[76,98,120,144,174,199],"V":[77,99,121,145,175,200],"(":[78,100,122,146,167,171,176,196,201],")|":[80,102,124,148,178,203],"D":[85],"ominating":[86],"(3-\u03f5)":[94,140],"M":[107],"ax":[108],"C":[109,131],"ut":[110],"dd":[130],"ycle":[132],"T":[133,187],"ransversal":[134],"For":[153],"fixed":[155],"q":[156,159,168],"\u2265":[157],"3,":[158],"-C":[160],"oloring":[161],"-\u03f5)":[169],"tw":[170,195],"P":[183],"artition":[184],"nto":[186],"riangles":[188],".":[206],"Our":[207],"match":[210],"times":[213],"best":[216],"known":[217],"problems,":[221],"up":[222],"to":[223],"base.":[228]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}