{"id":"https://openalex.org/W4230551286","doi":"https://doi.org/10.1145/3186898","title":"Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth","display_name":"Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth","publication_year":2018,"publication_date":"2018-06-16","ids":{"openalex":"https://openalex.org/W4230551286","doi":"https://doi.org/10.1145/3186898"},"language":"en","primary_location":{"id":"doi:10.1145/3186898","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3186898","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/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/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, 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/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":["University of Bergen and Institute of Mathematical Sciences, HBNI, Taramani, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen and Institute of Mathematical Sciences, HBNI, Taramani, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]},{"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\u0141 Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054859737","display_name":"Marcin Wrochna","orcid":"https://orcid.org/0000-0001-9346-2172"},"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":"Marcin Wrochna","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-9346-2172","affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8844,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.92355093,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"1","last_page":"45"},"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.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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/treewidth","display_name":"Treewidth","score":0.800262451171875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7035613656044006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.682360053062439},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6426252126693726},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5556617379188538},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5084077715873718},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.49601277709007263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4815152585506439},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3696736693382263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3255305886268616},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3032909035682678},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29178547859191895},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.26776570081710815},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20954975485801697}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.800262451171875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7035613656044006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.682360053062439},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6426252126693726},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5556617379188538},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5084077715873718},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.49601277709007263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4815152585506439},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3696736693382263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3255305886268616},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3032909035682678},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29178547859191895},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.26776570081710815},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20954975485801697}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3186898","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3186898","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":[{"id":"https://openalex.org/G7447913350","display_name":null,"funder_award_id":"2013/11/D/ST6/03073","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W1494735819","https://openalex.org/W1525930351","https://openalex.org/W1548225002","https://openalex.org/W1983383464","https://openalex.org/W1985061810","https://openalex.org/W1989556004","https://openalex.org/W1994963913","https://openalex.org/W1995725694","https://openalex.org/W2005079828","https://openalex.org/W2008292658","https://openalex.org/W2009281933","https://openalex.org/W2020880764","https://openalex.org/W2023810039","https://openalex.org/W2027562075","https://openalex.org/W2028357390","https://openalex.org/W2032560040","https://openalex.org/W2037106315","https://openalex.org/W2039305125","https://openalex.org/W2048362350","https://openalex.org/W2056228264","https://openalex.org/W2059372025","https://openalex.org/W2061782500","https://openalex.org/W2071362870","https://openalex.org/W2076164610","https://openalex.org/W2076736619","https://openalex.org/W2079887842","https://openalex.org/W2082180697","https://openalex.org/W2085550081","https://openalex.org/W2089939118","https://openalex.org/W2091299439","https://openalex.org/W2099463627","https://openalex.org/W2106515361","https://openalex.org/W2106759055","https://openalex.org/W2113679823","https://openalex.org/W2133352257","https://openalex.org/W2149342630","https://openalex.org/W2150148016","https://openalex.org/W2151617868","https://openalex.org/W2153441719","https://openalex.org/W2162003279","https://openalex.org/W2162150822","https://openalex.org/W2263976044","https://openalex.org/W2313886575","https://openalex.org/W2489406325","https://openalex.org/W2490706771","https://openalex.org/W2763868895","https://openalex.org/W2790553629","https://openalex.org/W2962968573","https://openalex.org/W2963751092","https://openalex.org/W3104625577","https://openalex.org/W4210733105","https://openalex.org/W4213060883","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2985636744","https://openalex.org/W1587078595","https://openalex.org/W1973972417","https://openalex.org/W1485639265","https://openalex.org/W2125058377","https://openalex.org/W2060933875","https://openalex.org/W133962531","https://openalex.org/W2059372025","https://openalex.org/W1586184743"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,16,23,29,32,41,44,57,60,76,93,96,101,107,112,120,137,144,147,202,266,272,300,330,342,353,357,360],"complexity":[3,263],"of":[4,25,31,40,59,75,95,119,149,173,204,302,314,316,333,344,355,362,365],"several":[5],"fundamental":[6],"polynomial-time":[7],"solvable":[8],"problems":[9,114,354],"on":[10,13,49,100],"graphs":[11,51],"and":[12,146,164,185,279,295,359],"matrices,":[14,26],"when":[15,274],"given":[17,99,275],"instance":[18],"has":[19],"low":[20,366],"treewidth;":[21],"in":[22,53,208,229,249,284,327],"case":[24],"we":[27,254],"consider":[28],"treewidth":[30,260,301],"graph":[33,277,364],"formed":[34],"by":[35],"non-zero":[36],"entries.":[37],"In":[38],"each":[39],"considered":[42,113],"cases,":[43],"best":[45,108],"known":[46,109],"algorithms":[47,71,110,345],"working":[48],"general":[50],"run":[52],"polynomial":[54,61],"time;":[55],"however,":[56],"exponent":[58],"is":[62,68,92,304,350],"large.":[63],"Therefore,":[64],"our":[65],"main":[66],"goal":[67],"to":[69,265],"construct":[70],"with":[72,261,329,346],"running":[73,267,348],"time":[74,163,184,262,285],"form":[77],"poly(":[78,83],"k":[79,84,91,158,179,191,214,235,281,288,307,320],")\u22c5":[80,85],"n":[81,86,88,125,151,153,161,182,194,196,217,220,238,240,291,293],"or":[82,309],"log":[87,195,218,239,292],",":[89,282,308],"where":[90],"width":[94,317],"tree":[97,312],"decomposition":[98,313],"input.":[102],"Such":[103],"procedures":[104],"would":[105],"outperform":[106],"for":[111,116,129,142,169,200,224,243,259,352],"already":[115],"moderate":[117],"values":[118],"treewidth,":[121],"like":[122],"O":[123,156,177,189,212,233,286,318],"(":[124,157,178,190,213,234,287,319],"1/":[126],"c":[127,132],")":[128,162,183,294],"a":[130,171,205,209,226,230,245,250,276,311,363],"constant":[131],".":[133],"Our":[134],"results":[135,325],"include":[136],"following:":[138],"\u2014":[139],"an":[140,150,256],"algorithm":[141,168,199,223,242,258],"computing":[143],"determinant":[145],"rank":[148],"\u00d7":[152],"matrix":[154],"using":[155,176],"3":[159,180,192],"\u22c5":[160,181,193,216,237,290],"arithmetic":[165,186],"operations;":[166,187],"\u2014an":[167,188,211,232],"solving":[170],"system":[172],"linear":[174],"equations":[175],")-time":[197,221,241],"randomized":[198,222],"finding":[201,244,356],"cardinality":[203],"maximum":[206,227,246],"matching":[207,228],"graph;":[210,231],"4":[215],"2":[219,236,321],"constructing":[225],"vertex":[247],"flow":[248],"directed":[251],"graph.":[252],"Moreover,":[253],"give":[255],"approximation":[257],"suited":[264],"times":[268,349],"as":[269],"above.":[270],"Namely,":[271],"algorithm,":[273],"G":[278,303,315],"integer":[280],"runs":[283],"7":[289],"either":[296],"correctly":[297],"reports":[298],"that":[299,341],"larger":[305],"than":[306],"constructs":[310],").":[322],"The":[323],"above":[324],"stand":[326],"contrast":[328],"recent":[331],"work":[332],"Abboud":[334],"et":[335],"al.":[336],"(SODA":[337],"2016),":[338],"which":[339],"shows":[340],"existence":[343],"similar":[347],"unlikely":[351],"diameter":[358],"radius":[361],"treewidth.":[367]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}