{"id":"https://openalex.org/W2243582562","doi":"https://doi.org/10.1145/2799640","title":"Exploring the Subexponential Complexity of Completion Problems","display_name":"Exploring the Subexponential Complexity of Completion Problems","publication_year":2015,"publication_date":"2015-08-31","ids":{"openalex":"https://openalex.org/W2243582562","doi":"https://doi.org/10.1145/2799640","mag":"2243582562"},"language":"en","primary_location":{"id":"doi:10.1145/2799640","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2799640","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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/A5064442594","display_name":"P\u00e5l Gr\u00f8n\u00e5s Drange","orcid":"https://orcid.org/0000-0001-7228-6640"},"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":"P\u00e5l Gr\u00f8n\u00e5s Drange","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","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":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"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/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":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109879985","display_name":"Yngve Villanger","orcid":null},"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":"Yngve Villanger","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":5.6466,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.96512046,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"4","first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9890000224113464,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8604388236999512},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8402044177055359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6738690137863159},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5778957605361938},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5190449357032776},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5067296624183655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44438132643699646},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43993204832077026},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4106413424015045}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8604388236999512},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8402044177055359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6738690137863159},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5778957605361938},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5190449357032776},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5067296624183655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44438132643699646},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43993204832077026},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4106413424015045}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2799640","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2799640","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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":38,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1570340896","https://openalex.org/W1570425181","https://openalex.org/W1579049696","https://openalex.org/W1674929459","https://openalex.org/W1754878559","https://openalex.org/W1815738779","https://openalex.org/W1881622208","https://openalex.org/W1985427743","https://openalex.org/W1995725694","https://openalex.org/W1997477404","https://openalex.org/W1998552318","https://openalex.org/W2012067448","https://openalex.org/W2027566319","https://openalex.org/W2030064859","https://openalex.org/W2048845385","https://openalex.org/W2051576576","https://openalex.org/W2059401572","https://openalex.org/W2085468469","https://openalex.org/W2086331454","https://openalex.org/W2087083200","https://openalex.org/W2104894563","https://openalex.org/W2126383829","https://openalex.org/W2143474538","https://openalex.org/W2144050783","https://openalex.org/W2155453078","https://openalex.org/W2158584754","https://openalex.org/W2168123742","https://openalex.org/W2168488683","https://openalex.org/W2271457994","https://openalex.org/W2561675875","https://openalex.org/W2570366614","https://openalex.org/W2908014032","https://openalex.org/W2912532202","https://openalex.org/W2949581077","https://openalex.org/W3022173737","https://openalex.org/W4285719527","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2173621488","https://openalex.org/W4389156785","https://openalex.org/W2113885662","https://openalex.org/W3130864778","https://openalex.org/W2914832887","https://openalex.org/W4384270378","https://openalex.org/W4388561627","https://openalex.org/W2585468647","https://openalex.org/W4221165109","https://openalex.org/W2177663427"],"abstract_inverted_index":{"Let":[0],"F":[1,9,50,64,82,94,123,165,208,213,277,309,318,323,329,336,344,379,385],"be":[2,35,348],"a":[3,47,75,113,221,224,370],"family":[4],"of":[5,63,72,93,110,122,154,180,373,378],"graphs.":[6],"In":[7,169],"the":[8,41,70,91,108,120,158,250,258,313,358,374],"-C":[10,65,166,310,345,380],"ompletion":[11,66,167,204,211,256,273,311,346,381],"problem,":[12],"we":[13,172],"are":[14,135,288],"given":[15],"an":[16,22,52],"n":[17,148,242,300,354],"-vertex":[18],"graph":[19,43,48,77,115],"G":[20,38],"and":[21,27,106,186,223,269,335,366],"integer":[23],"k":[24,32,144,146,238,240,296,298],"as":[25,51,79,252],"input,":[26],"asked":[28],"whether":[29],"at":[30],"most":[31],"edges":[33],"can":[34],"added":[36],"to":[37,90],"so":[39],"that":[40,59,118,174],"resulting":[42],"does":[44],"not":[45],"contain":[46],"from":[49],"induced":[53,184],"subgraph.":[54],"It":[55],"was":[56],"shown":[57],"recently":[58],"two":[60],"special":[61],"cases":[62],",":[67,98,101,104,127,131,205,217,257,265,274,281,284,340,390,393],"namely,":[68],"(i)":[69],"problem":[71,109,198],"completing":[73,111],"into":[74,112,176],"chordal":[76],"known":[78,248],"M":[80],"inimum":[81],"ill-in":[83],"(SIAM":[84],"J.":[85],"Comput.":[86],"2013),":[87],"which":[88,206,261,276],"corresponds":[89],"case":[92,121,259],"={":[95,124,214,330],"C":[96,99,102,125,132,203,210,215,255,266,272,285,326,391],"4":[97,126,216,219,267,283,286,327,333,342,392,395],"5":[100,133],"6":[103],"\u2026},":[105],"(ii)":[107],"split":[114],"(Algorithmica":[116],"2015),":[117],"is,":[119],"2":[128,130,141,235,264,280,293,321,339,352,389],"K":[129,263,279,320,338,388],"},":[134,220,268,287,322,328,334,343],"solvable":[136,230,290],"in":[137,231,249,260,275,291,350],"parameterized":[138,190,232,376],"subexponential":[139,191,233,375],"time":[140,192,234,292,351],"O":[142,149,236,243,294,301,355],"(\u221a":[143,237,295],"log":[145,239,297],")":[147,241,299],"(1)":[150,244,356],".":[151,168,245,303],"The":[152],"exploration":[153],"this":[155,170],"phenomenon":[156],"is":[157,207,229],"main":[159],"motivation":[160],"for":[161,212,308,383],"our":[162,306],"research":[163],"on":[164,226],"article,":[171],"prove":[173],"completions":[175],"several":[177],"well-studied":[178],"classes":[179],"graphs":[181],"without":[182],"long":[183],"cycles":[185],"paths":[187],"also":[188,289],"admit":[189],"algorithms":[193,307],"by":[194],"showing":[195],"that:":[196],"\u2014The":[197,246],"T":[199,270],"rivially":[200],"P":[201,218,253,282,331,341,394],"erfect":[202],"-":[209],"cycle":[222],"path":[225],"four":[227],"vertices,":[228],"problems":[247,382],"literature":[251],"seudosplit":[254],"F{2":[262],"hreshold":[271],"=2":[278],"}(1)":[302],"We":[304],"complement":[305],"with":[312],"following":[314],"lower":[315,367],"bounds:":[316],"\u2014For":[317],"={2":[319,337],"=":[324],"{":[325],"o":[332],"cannot":[347],"solved":[349],"o(k)":[353],"unless":[357],"Exponential":[359],"Time":[360],"Hypothesis":[361],"(ETH)":[362],"fails.":[363],"Our":[364],"upper":[365],"bounds":[368],"provide":[369],"complete":[371],"picture":[372],"complexity":[377],"any":[384],"\u2286":[386],"{2":[387],"}.":[396]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}