{"id":"https://openalex.org/W4390918625","doi":"https://doi.org/10.1145/3640814","title":"Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds","display_name":"Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds","publication_year":2024,"publication_date":"2024-01-16","ids":{"openalex":"https://openalex.org/W4390918625","doi":"https://doi.org/10.1145/3640814"},"language":"en","primary_location":{"id":"doi:10.1145/3640814","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3640814","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/A5002287702","display_name":"Jacob Focke","orcid":"https://orcid.org/0000-0002-6895-755X"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jacob Focke","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarb\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarb\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"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/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarb\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarb\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047941027","display_name":"Pawe\u0142 Rz\u0105\u017cewski","orcid":"https://orcid.org/0000-0001-7696-3848"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Rz\u0105\u017cewski","raw_affiliation_strings":["Warsaw University of Technology, Faculty of Mathematics and Information Science, Warsaw, Poland and Warsaw, Institute of Informatics, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, Faculty of Mathematics and Information Science, Warsaw, Poland and Warsaw, Institute of Informatics, Warsaw, Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002287702"],"corresponding_institution_ids":["https://openalex.org/I4210128801"],"apc_list":null,"apc_paid":null,"fwci":1.4468,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81707013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"20","issue":"2","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994000196456909,"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.9986000061035156,"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/treewidth","display_name":"Treewidth","score":0.8873192071914673},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.7261848449707031},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6897063851356506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6389879584312439},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6134446263313293},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6126899123191833},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5656010508537292},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5504579544067383},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.518010675907135},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.48267319798469543},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4622838795185089},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.42054545879364014},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4193267822265625},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4122235178947449},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.393571674823761},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3533781170845032},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11425381898880005}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8873192071914673},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.7261848449707031},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6897063851356506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6389879584312439},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6134446263313293},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6126899123191833},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5656010508537292},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5504579544067383},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.518010675907135},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.48267319798469543},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4622838795185089},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.42054545879364014},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4193267822265625},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4122235178947449},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.393571674823761},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3533781170845032},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11425381898880005},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3640814","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3640814","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/G7561358084","display_name":null,"funder_award_id":"2018/31/D/ST6/00062","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1572041907","https://openalex.org/W1602309302","https://openalex.org/W1977197609","https://openalex.org/W1980790276","https://openalex.org/W1984264511","https://openalex.org/W2005253487","https://openalex.org/W2021372200","https://openalex.org/W2032487621","https://openalex.org/W2038074073","https://openalex.org/W2040145343","https://openalex.org/W2077575555","https://openalex.org/W2115826669","https://openalex.org/W2150339067","https://openalex.org/W2172276559","https://openalex.org/W2199961663","https://openalex.org/W2789288165","https://openalex.org/W2798803126","https://openalex.org/W2800485060","https://openalex.org/W2963282263","https://openalex.org/W2964157411","https://openalex.org/W2964301480","https://openalex.org/W3082547133","https://openalex.org/W3129539141","https://openalex.org/W3141446590","https://openalex.org/W3160700943","https://openalex.org/W4235666125","https://openalex.org/W4237554979","https://openalex.org/W4247305611","https://openalex.org/W4249717465"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W143512583","https://openalex.org/W4285428820","https://openalex.org/W2803227791","https://openalex.org/W1538433552"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,14,17,82,89,157,181,190,206,215,231,256,276,314],"this":[3],"work":[4],"is":[5,76,106,147,153,171,177,186,237,243,283,321],"to":[6,235,261],"give":[7,336],"precise":[8,338],"bounds":[9,348],"on":[10,23],"the":[11,50,63,87,116,120,138,154,178,191,204,229,254,286,324,327],"counting":[12,232],"complexity":[13,341],"a":[15,44,79,127,144,158,183,273,311,337],"family":[16],"generalized":[18],"coloring":[19],"problems":[20],"(list":[21],"homomorphisms)":[22],"bounded-treewidth":[24],"graphs.":[25],"Given":[26],"graphs":[27,352],"G":[28,75,277,315],",":[29,31,43,85,113,131,197,253,294,308],"H":[30,112,130,135,142,151,170,175,196,201,216,226,236,252,262],"and":[32,61,240,339,346],"lists":[33,64],"L":[34],"(v)":[35],"\u2286":[36],"V(H)":[37,47,161],"for":[38,108,248,303,349],"every":[39,109,211,249],"v":[40],"\u2208":[41,54,58,67],"V(G)":[42],"f:V(G)":[45],"\u2192":[46],"that":[48,73,185,223,291],"preserves":[49],"edges":[51],"(i.e.,":[52,65],"uv":[53],"E(G)":[55],"implies":[56],"f(u)f(v)":[57],"E(H)":[59],")":[60,136,152,176,202,209],"respects":[62],"f(v)":[66],"L(v)":[68],").":[69],"Standard":[70],"techniques":[71],"show":[72,246],"if":[74,141,169,224,272,310],"given":[77,284,290,322],"with":[78,353],"tree":[80,274,312],"decomposition":[81,275,313],"width":[83,279,317],"t":[84,98,282,320],"then":[86,149,173,228],"number":[88,255],"list":[90,233,257],"homomorphisms":[91,234,258],"can":[92,123,264],"be":[93,124,265,296],"counted":[94,266,297],"in":[95,119,137,188,267,285,298,323],"time":[96,122,268,299],"|V(H)|":[97,118],"\u22c5":[99],"n":[100],"\ud835\udcaa(1)":[101],".":[102,217],"Our":[103],"main":[104],"result":[105],"determining,":[107],"fixed":[110,250],"graph":[111,129,251],"how":[114],"much":[115],"base":[117],"running":[121],"improved.":[125],"For":[126,194],"connected":[128,212],"we":[132,198,335],"define":[133,199],"irr(":[134,150,174,200,207,225],"following":[139],"way:":[140],"has":[143],"loop":[145],"or":[146,354],"nonbipartite,":[148],"maximum":[155,179,205],"size":[156,180],"set":[159,184],"S\u2286":[160],"where":[162],"any":[163,304],"two":[164],"vertices":[165],"have":[166],"different":[167],"neighborhoods;":[168],"bipartite,":[172],"such":[182],"fully":[187],"one":[189],"bipartition":[192],"classes.":[193],"disconnected":[195],"as":[203],"C":[208,214],"over":[210],"component":[213],"It":[218],"follows":[219],"from":[220,259],"earlier":[221],"results":[222],")=1,":[227],"problem":[230],"polynomial-time":[238],"solvable,":[239],"otherwise":[241],"it":[242],"#P-hard.":[244],"We":[245],"that,":[247],"(G,L)":[260],"\u2014":[263,289],"\\(\\operatorname{irr}(H)^t\\cdot":[269],"n^{\\mathcal":[270,301],"{O}(1)}\\)":[271,302],"having":[278,316],"at":[280,318],"most":[281,319],"input,":[287,325],"and,":[288],"\\(\\operatorname{irr}(H)\\ge":[292],"2\\)":[293],"cannot":[295],"\\((\\operatorname{irr}(H)-\\varepsilon)^t\\cdot":[300],"\\(\\varepsilon":[305],"\\gt":[306],"0\\)":[307],"even":[309],"unless":[326],"Counting":[328],"Strong":[329],"Exponential-Time":[330],"Hypothesis":[331],"(#SETH)":[332],"fails.":[333],"Thereby,":[334],"complete":[340],"classification":[342],"featuring":[343],"matching":[344],"upper":[345],"lower":[347],"all":[350],"target":[351],"without":[355],"loops.":[356]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}