{"id":"https://openalex.org/W3011735201","doi":"https://doi.org/10.1145/3381426","title":"Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems","display_name":"Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems","publication_year":2020,"publication_date":"2020-03-11","ids":{"openalex":"https://openalex.org/W3011735201","doi":"https://doi.org/10.1145/3381426","mag":"3011735201"},"language":"en","primary_location":{"id":"doi:10.1145/3381426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3381426","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/A5064783288","display_name":"Ivan Bliznets","orcid":"https://orcid.org/0000-0003-2291-2556"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Ivan Bliznets","raw_affiliation_strings":["National Research University Higher School of Economics, St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Research University Higher School of Economics, St. Petersburg, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"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":"Marek Cygan","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068064690","display_name":"Pawe\u0142 Komosa","orcid":null},"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":"Pawe\u0142 Komosa","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, 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":["University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070203454","display_name":"Luk\u00e1\u0161 Mach","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Luk\u00e1\u0161 Mach","raw_affiliation_strings":["University of Warwick, Coventry, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, England","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.6698913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"2","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9902999997138977,"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/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.8708944320678711},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7721998691558838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.761084258556366},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7361493110656738},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6490198373794556},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5455141067504883},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5430417060852051},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5050292611122131},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4817533493041992},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4712401032447815},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4676731526851654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4539364278316498},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.45254820585250854},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4325532615184784},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.427661657333374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21743229031562805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10207533836364746}],"concepts":[{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.8708944320678711},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7721998691558838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.761084258556366},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7361493110656738},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6490198373794556},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5455141067504883},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5430417060852051},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5050292611122131},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4817533493041992},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4712401032447815},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4676731526851654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4539364278316498},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45254820585250854},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4325532615184784},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.427661657333374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21743229031562805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10207533836364746},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3381426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3381426","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":33,"referenced_works":["https://openalex.org/W1507717186","https://openalex.org/W1527197079","https://openalex.org/W1881622208","https://openalex.org/W1995725694","https://openalex.org/W2012067448","https://openalex.org/W2027566319","https://openalex.org/W2029910715","https://openalex.org/W2030087828","https://openalex.org/W2036871172","https://openalex.org/W2038691311","https://openalex.org/W2072500816","https://openalex.org/W2072802070","https://openalex.org/W2082806890","https://openalex.org/W2086331454","https://openalex.org/W2091858563","https://openalex.org/W2114519943","https://openalex.org/W2124900884","https://openalex.org/W2125720043","https://openalex.org/W2127485201","https://openalex.org/W2154918515","https://openalex.org/W2162561603","https://openalex.org/W2166566648","https://openalex.org/W2169528477","https://openalex.org/W2249739104","https://openalex.org/W2271457994","https://openalex.org/W2490706771","https://openalex.org/W2570366614","https://openalex.org/W2908014032","https://openalex.org/W2913028927","https://openalex.org/W4210733105","https://openalex.org/W4235946010","https://openalex.org/W4300832559","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2006955534","https://openalex.org/W2153789027","https://openalex.org/W1987143101","https://openalex.org/W1994156213","https://openalex.org/W2251679127","https://openalex.org/W2272336114","https://openalex.org/W1534996675","https://openalex.org/W2407722793","https://openalex.org/W2124526408","https://openalex.org/W4387704327"],"abstract_inverted_index":{"In":[0,46],"this":[1],"work,":[2],"we":[3,257,297],"focus":[4],"on":[5,153,263],"several":[6],"completion":[7,189],"problems":[8,105,165],"for":[9,81,88,134,148,157,247,308,327],"subclasses":[10],"of":[11,103,143,163,205,230,232,244,268,274,286,305],"chordal":[12],"graphs:":[13],"M":[14,149,248],"INIMUM":[15],"F":[16,328],"ILL":[17],"-I":[18],"N":[19],",":[20,25,32,39,133,161,199,277],"I":[21,28,195],"NTERVAL":[22,29,196],"C":[23,30,37,43,91,93,197],"OMPLETION":[24,31,38,44,94,198],"P":[26,35,193],"ROPER":[27,194],"T":[33,41,335],"RIVIALLY":[34],"ERFECT":[36],"and":[40],"HRESHOLD":[42],".":[45,138,184,252,337],"these":[47,83,104,164,233],"problems,":[48,84,190],"the":[49,77,89,98,141,187,206,222,242,265,280,284,303,309],"task":[50],"is":[51],"to":[52,58,62,237],"add":[53],"at":[54],"most":[55],"k":[56,124,128,211,213],"edges":[57],"a":[59,64,144,227,238,259,271],"given":[60],"graph":[61],"obtain":[63,299],"chordal,":[65],"interval,":[66,68],"proper":[67],"threshold,":[69],"or":[70,120,176],"trivially":[71],"perfect":[72],"graph,":[73],"respectively.":[74],"We":[75],"prove":[76,254],"following":[78],"lower":[79,300,325],"bounds":[80,301,326],"all":[82,186],"as":[85,87,317,319],"well":[86,318],"related":[90],"HAIN":[92],"problem:":[95],"\u2022":[96,139],"Assuming":[97,140],"Exponential":[99],"Time":[100],"Hypothesis,":[101],"none":[102,162],"can":[106,166],"be":[107,167],"solved":[108,168],"in":[109,169,241],"time":[110,170,204],"2":[111,121,171,177,208],"O":[112,122,131,182,209,217,310],"(":[113,123,173],"n":[114,118,130,174,181,216],"1/2":[115],"/log":[116,126],"c":[117,127,137],")":[119,175,214],"1/4":[125],")\u00b7":[129],"(1)":[132,183,218],"some":[135,158],"integer":[136],"non-existence":[142],"subexponential-time":[145],"approximation":[146,245],"scheme":[147],"IN":[150,249,334],"B":[151,250],"ISECTION":[152,251],"d":[154,160],"-regular":[155],"graphs,":[156],"constant":[159],"o":[172,178],"\u221ak)":[179],"}\u00b7":[180],"For":[185],"aforementioned":[188],"apart":[191],"from":[192,293],"FPT":[200],"algorithms":[201,234,246,307],"with":[202,270,283],"running":[203],"form":[207],"(\u221a":[210],"log":[212],"\u00b7":[215],"are":[219],"known.":[220],"Thus,":[221],"second":[223],"result":[224],"proves":[225],"that":[226],"significant":[228],"improvement":[229],"any":[231],"would":[235],"lead":[236],"surprising":[239],"breakthrough":[240],"design":[243],"To":[253],"our":[255,294],"results,":[256,296],"use":[258],"reduction":[260],"methodology":[261],"based":[262],"combining":[264],"classic":[266],"approach":[267],"starting":[269],"sparse":[272],"instance":[273],"3-S":[275],"AT":[276],"prepared":[278],"using":[279],"Sparsification":[281],"Lemma,":[282],"existence":[285,304],"almost":[287],"linear-size":[288],"Probabilistically":[289],"Checkable":[290],"Proofs.":[291],"Apart":[292],"main":[295],"also":[298],"excluding":[302],"subexponential":[306],"PTIMUM":[311],"L":[312],"INEAR":[313],"A":[314,330],"RRANGEMENT":[315],"problem,":[316],"improved,":[320],"yet":[321],"still":[322],"not":[323],"tight,":[324],"EEDBACK":[329],"RC":[331],"S":[332],"ET":[333],"OURNAMENTS":[336]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}