{"id":"https://openalex.org/W2150004999","doi":"https://doi.org/10.4086/toc.2010.v006a005","title":"","display_name":"","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2150004999","doi":"https://doi.org/10.4086/toc.2010.v006a005","mag":"2150004999"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2010.v006a005","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a005","pdf_url":"https://theoryofcomputing.org/articles/v006a005/v006a005.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v006a005/v006a005.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel Marx","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.5069,"has_fulltext":true,"cited_by_count":164,"citation_normalized_percentile":{"value":0.97497565,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"6","issue":"1","first_page":"85","last_page":"112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9940000176429749,"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.9514999985694885,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8508009910583496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7553600072860718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7312735915184021},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.6045708656311035},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5710358023643494},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5549769401550293},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5036818385124207},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5000205039978027},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49066388607025146},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.48689666390419006},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.45039597153663635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38931500911712646},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3062240481376648},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2966916561126709},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2671470642089844},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.221034437417984}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8508009910583496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7553600072860718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7312735915184021},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.6045708656311035},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5710358023643494},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5549769401550293},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5036818385124207},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5000205039978027},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49066388607025146},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.48689666390419006},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.45039597153663635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38931500911712646},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3062240481376648},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2966916561126709},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2671470642089844},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.221034437417984},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2010.v006a005","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a005","pdf_url":"https://theoryofcomputing.org/articles/v006a005/v006a005.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2010.v006a005","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a005","pdf_url":"https://theoryofcomputing.org/articles/v006a005/v006a005.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4547255915","display_name":null,"funder_award_id":"OTKA 67651","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320321038","display_name":"Fonds National de la Recherche Luxembourg","ror":"https://ror.org/039z13y21"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2150004999.pdf","grobid_xml":"https://content.openalex.org/works/W2150004999.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W99828349","https://openalex.org/W132145278","https://openalex.org/W1500793656","https://openalex.org/W1539745358","https://openalex.org/W1560870503","https://openalex.org/W1565047086","https://openalex.org/W1570425181","https://openalex.org/W1571197496","https://openalex.org/W1684108869","https://openalex.org/W1973819999","https://openalex.org/W1983022219","https://openalex.org/W1987681136","https://openalex.org/W1994520092","https://openalex.org/W1997649256","https://openalex.org/W2019404372","https://openalex.org/W2023652218","https://openalex.org/W2027519504","https://openalex.org/W2029448190","https://openalex.org/W2048958388","https://openalex.org/W2049197377","https://openalex.org/W2051627428","https://openalex.org/W2054605652","https://openalex.org/W2057826895","https://openalex.org/W2066776015","https://openalex.org/W2076164610","https://openalex.org/W2087083200","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2134850460","https://openalex.org/W2150148016","https://openalex.org/W2150339067","https://openalex.org/W2159738186","https://openalex.org/W2166566648","https://openalex.org/W2296148711","https://openalex.org/W2477275781","https://openalex.org/W2489752112","https://openalex.org/W2504838369","https://openalex.org/W2952861917","https://openalex.org/W4255801061","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W6903974","https://openalex.org/W1572255008","https://openalex.org/W1490290385","https://openalex.org/W1539278744","https://openalex.org/W2084535634","https://openalex.org/W2550548770","https://openalex.org/W2313886575","https://openalex.org/W3158696645"],"abstract_inverted_index":{"It":[0],"is":[1,29,35,90,107,119,124,134],"well-known":[2],"that":[3,43,87,100],"constraint":[4,81],"satisfaction":[5],"problems":[6],"(CSP)":[7],"over":[8],"an":[9,71,135],"unbounded":[10,97],"domain":[11],"can":[12,46],"be":[13,70],"solved":[14],"in":[15,120,150],"time":[16,103],"n":[17,34],"O(k)":[18],"if":[19,55,88],"the":[20,23,27,36,39,58,101,125,128,139,147,151,156,166,169,172,177,181,184,191,197],"treewidth":[21,98,126,167,182],"of":[22,26,38,64,94,104,127,155,168,171,183,199],"primal":[24,65,116,129,185],"graph":[25,117,130,186],"instance":[28],"at":[30],"most":[31],"k":[32,123],"and":[33,132],"size":[37],"input.":[40],"We":[41,85,145],"show":[42],"no":[44],"algorithm":[45,72,105],"do":[47],"significantly":[48],"better":[49],"than":[50],"this":[51,164],"treewidth-based":[52],"algorithm,":[53],"even":[54],"we":[56,189],"restrict":[57],"problem":[59,158],"to":[60,193],"some":[61],"special":[62],"class":[63,92],"graphs.":[66],"Formally,":[67],"let":[68],"A":[69,106],"solving":[73],"binary":[74],"CSP":[75,78],"(i.":[76],"e.,":[77],"where":[79,122],"every":[80],"involves":[82],"two":[83],"variables).":[84],"prove":[86,146],"there":[89],"a":[91],"G":[93,118,131],"graphs":[95],"with":[96],"such":[99],"running":[102],"f":[108,133],"(G)n":[109],"o(k/":[110],"log":[111],"k)":[112],"on":[113,196],"instances":[114],"whose":[115],"G,":[121],"arbitrary":[136],"function,":[137],"then":[138],"Exponential":[140],"Time":[141],"Hypothesis":[142],"(ETH)":[143],"fails.":[144],"result":[148],"also":[149],"more":[152],"general":[153],"framework":[154],"homomorphism":[157],"for":[159],"bounded-arity":[160],"relational":[161],"structures.":[162],"For":[163],"problem,":[165],"core":[170],"lefthand":[173],"side":[174],"structure":[175],"plays":[176],"same":[178],"role":[179],"as":[180],"above.":[187],"Finally,":[188],"use":[190],"results":[192],"obtain":[194],"corollaries":[195],"complexity":[198],"(Colored/Partitioned)":[200],"Subgraph":[201],"Isomorphism.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2016-06-24T00:00:00"}