{"id":"https://openalex.org/W2570366614","doi":"https://doi.org/10.1137/11085390x","title":"Subexponential Parameterized Algorithm for Minimum Fill-In","display_name":"Subexponential Parameterized Algorithm for Minimum Fill-In","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2570366614","doi":"https://doi.org/10.1137/11085390x","mag":"2570366614"},"language":"en","primary_location":{"id":"doi:10.1137/11085390x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11085390x","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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, Bergen, Norway,"],"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,"],"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":2,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":10.3563,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.98766174,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"42","issue":"6","first_page":"2197","last_page":"2216"},"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.998199999332428,"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.993399977684021,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8336181640625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8021523952484131},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6726587414741516},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5290036797523499},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5199655294418335},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46987444162368774},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.458343505859375},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.42887240648269653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3590223789215088}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8336181640625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8021523952484131},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6726587414741516},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5290036797523499},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5199655294418335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46987444162368774},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.458343505859375},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.42887240648269653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3590223789215088}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/11085390x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11085390x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3748656914","display_name":null,"funder_award_id":"Norway","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"}],"funders":[{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1593793857","https://openalex.org/W1981917097","https://openalex.org/W1985733932","https://openalex.org/W1995725694","https://openalex.org/W2005576669","https://openalex.org/W2008238596","https://openalex.org/W2010030994","https://openalex.org/W2012067448","https://openalex.org/W2014252825","https://openalex.org/W2027502367","https://openalex.org/W2027566319","https://openalex.org/W2029095423","https://openalex.org/W2030064859","https://openalex.org/W2030330259","https://openalex.org/W2035331304","https://openalex.org/W2038049091","https://openalex.org/W2038865230","https://openalex.org/W2056976531","https://openalex.org/W2061782500","https://openalex.org/W2086119402","https://openalex.org/W2086331454","https://openalex.org/W2089465933","https://openalex.org/W2090579013","https://openalex.org/W2097374444","https://openalex.org/W2124174860","https://openalex.org/W2144050783","https://openalex.org/W2148417962","https://openalex.org/W2158437920","https://openalex.org/W2158584754","https://openalex.org/W2159596482","https://openalex.org/W2165605193"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2584187496","https://openalex.org/W2996212809","https://openalex.org/W2887154986","https://openalex.org/W2039086323","https://openalex.org/W2404515776"],"abstract_inverted_index":{"The":[0],"Minimum":[1,59,77,92],"Fill-in":[2,60,78],"problem":[3,29],"is":[4,30,46],"used":[5,81],"to":[6,82],"decide":[7],"if":[8],"a":[9],"graph":[10],"can":[11,79],"be":[12,80],"triangulated":[13],"by":[14],"adding":[15],"at":[16],"most":[17],"$k$":[18],"edges.":[19],"In":[20],"1994,":[21],"Kaplan,":[22],"Shamir,":[23],"and":[24,41,44,98],"Tarjan":[25],"showed":[26],"that":[27],"the":[28,53,69,72],"solvable":[31],"in":[32,61],"time":[33,62],"$\\mathcal{O}(2^{\\mathcal{O}({k})}+k^2":[34],"nm)$":[35],"on":[36],"graphs":[37],"with":[38],"$n$":[39],"vertices":[40],"$m$":[42],"edges":[43],"thus":[45],"fixed":[47],"parameter":[48],"tractable.":[49],"Here,":[50],"we":[51],"give":[52],"first":[54],"subexponential":[55,84],"parameterized":[56,85],"algorithm":[57],"solving":[58],"$\\mathcal{O}(2^{\\mathcal{O}(\\sqrt{k}\\log{k})}":[63],"+k^2":[64],"nm)$.":[65],"This":[66],"substantially":[67],"lowers":[68],"complexity":[70],"of":[71],"problem.":[73],"Techniques":[74],"developed":[75],"for":[76,87],"obtain":[83],"algorithms":[86],"several":[88],"related":[89],"problems,":[90],"including":[91],"Chain":[93],"Completion,":[94],"Chordal":[95],"Graph":[96],"Sandwich,":[97],"Triangulating":[99],"Colored":[100],"Graph.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}