{"id":"https://openalex.org/W2107918022","doi":"https://doi.org/10.1007/s00037-005-0195-9","title":"Parameterized complexity of constraint satisfaction problems","display_name":"Parameterized complexity of constraint satisfaction problems","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2107918022","doi":"https://doi.org/10.1007/s00037-005-0195-9","mag":"2107918022"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-005-0195-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0195-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0195-9.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0195-9.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":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1521, Budapest, Hungary","Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary H-1521#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1521, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary H-1521#TAB#","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":2.7669,"has_fulltext":true,"cited_by_count":51,"citation_normalized_percentile":{"value":0.9203587,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"153","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.995199978351593,"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.995199978351593,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9653000235557556,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9197350740432739},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7673248648643494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.739905595779419},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7069370746612549},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6562270522117615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5990875363349915},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5817553997039795},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.524445116519928},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5205962657928467},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5125174522399902},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.07436701655387878},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.059180229902267456}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9197350740432739},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7673248648643494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.739905595779419},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7069370746612549},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6562270522117615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5990875363349915},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5817553997039795},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.524445116519928},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5205962657928467},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5125174522399902},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.07436701655387878},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.059180229902267456},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-005-0195-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0195-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0195-9.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.5014","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.5014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bme.hu/~dmarx/papers/marx-ccc2004.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/s00037-005-0195-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0195-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0195-9.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2107918022.pdf","grobid_xml":"https://content.openalex.org/works/W2107918022.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1599092334","https://openalex.org/W1967066104","https://openalex.org/W1987374783","https://openalex.org/W2016341899","https://openalex.org/W2024291212","https://openalex.org/W2053439155","https://openalex.org/W2059372025","https://openalex.org/W2066577300","https://openalex.org/W2068190866","https://openalex.org/W2074210283","https://openalex.org/W2087083200","https://openalex.org/W2108093643","https://openalex.org/W2117290960","https://openalex.org/W2129023820","https://openalex.org/W2150339067","https://openalex.org/W2156760067","https://openalex.org/W2166566648","https://openalex.org/W4292230561","https://openalex.org/W6641894202"],"related_works":["https://openalex.org/W2113684989","https://openalex.org/W4389814085","https://openalex.org/W1531868704","https://openalex.org/W4285659194","https://openalex.org/W3031065515","https://openalex.org/W2364477340","https://openalex.org/W2039168577","https://openalex.org/W3048010228","https://openalex.org/W4382239723","https://openalex.org/W56447744"],"abstract_inverted_index":{"We":[0,42],"prove":[1],"a":[2,21,28,44],"parameterized":[3],"analog":[4],"of":[5,31,47],"Schaefer\u2019s":[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,90],"\u2131,":[18],"deciding":[19],"whether":[20],"formula":[22,61],"containing":[23],"constraints":[24,49],"from":[25],"\u2131":[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],"(FPT)":[39],"or":[40,70],"W[1]-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],"\u2131.":[91]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}