{"id":"https://openalex.org/W4245692971","doi":"https://doi.org/10.1109/ccc.2004.1313823","title":"Parameterized complexity of constraint satisfaction problems","display_name":"Parameterized complexity of constraint satisfaction problems","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W4245692971","doi":"https://doi.org/10.1109/ccc.2004.1313823"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2004.1313823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-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/A5043429138","display_name":"D. Marx","orcid":null},"institutions":[{"id":"https://openalex.org/I3131446353","display_name":"Andr\u00e1ssy University Budapest","ror":"https://ror.org/05xezqk59","country_code":"HU","type":"education","lineage":["https://openalex.org/I3131446353"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D. Marx","raw_affiliation_strings":["Department of Computer Science and Information Theory, Budapest University\uc2a0of\uc2a0Technology\uc2a0and\uc2a0Economics, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University\uc2a0of\uc2a0Technology\uc2a0and\uc2a0Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I3131446353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043429138"],"corresponding_institution_ids":["https://openalex.org/I3131446353"],"apc_list":null,"apc_paid":null,"fwci":1.0115,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78735241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"149"},"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/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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.9965000152587891,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9250096082687378},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7564491033554077},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7352644205093384},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7125146985054016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6657412648200989},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6343863010406494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5965293049812317},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5955662727355957},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5209754109382629},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49333682656288147},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.4328477680683136},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.42158788442611694},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.36991238594055176},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.07991600036621094},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05464377999305725}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9250096082687378},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7564491033554077},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7352644205093384},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7125146985054016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6657412648200989},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6343863010406494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5965293049812317},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5955662727355957},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5209754109382629},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49333682656288147},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.4328477680683136},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.42158788442611694},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.36991238594055176},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.07991600036621094},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05464377999305725},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccc.2004.1313823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1727001693","https://openalex.org/W1967066104","https://openalex.org/W1987374783","https://openalex.org/W2016341899","https://openalex.org/W2066577300","https://openalex.org/W2068190866","https://openalex.org/W2087083200","https://openalex.org/W2117290960","https://openalex.org/W2129023820","https://openalex.org/W2150339067","https://openalex.org/W2156760067","https://openalex.org/W2166566648","https://openalex.org/W4213368513","https://openalex.org/W4292230561","https://openalex.org/W6635718152"],"related_works":["https://openalex.org/W2784687883","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2124452950","https://openalex.org/W2012694101","https://openalex.org/W2737098235","https://openalex.org/W2295056692","https://openalex.org/W3122034878","https://openalex.org/W2012141606","https://openalex.org/W1551482454"],"abstract_inverted_index":{"We":[0,42],"prove":[1],"a":[2,21,28,44],"parameterized":[3],"analog":[4],"of":[5,31,47],"Schaefer's":[6],"Dichotomy":[7],"Theorem:":[8],"we":[9],"show":[10],"that":[11,50,78],"for":[12,87],"every":[13,88],"finite":[14],"Boolean":[15],"constraint":[16,89],"family":[17],"F,":[18],"deciding":[19],"whether":[20],"formula":[22,61],"containing":[23],"constraints":[24,49],"from":[25],"F":[26],"has":[27],"satisfying":[29],"assignment":[30],"weight":[32],"exactly":[33],"k":[34],"is":[35,62,84],"either":[36],"fixed-parameter":[37,54],"tractable":[38],"(TPT,)":[39],"or":[40,70],"W[l]-complete.":[41],"give":[43],"simple":[45],"characterization":[46],"those":[48],"make":[51],"the":[52,60,82],"problem":[53,83],"tractable.":[55],"The":[56],"special":[57],"cases":[58,81],"when":[59],"restricted":[63],"to":[64],"be":[65],"bounded":[66,68],"occurrence,":[67],"treewidth":[69],"planar":[71],"are":[72],"also":[73],"considered,":[74],"it":[75],"turns":[76],"out":[77],"in":[79,85],"these":[80],"FPT":[86],"family,":[90],"F.":[91]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}