{"id":"https://openalex.org/W2569790754","doi":"https://doi.org/10.1137/120882160","title":"Constraint Satisfaction Parameterized by Solution Size","display_name":"Constraint Satisfaction Parameterized by Solution Size","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2569790754","doi":"https://doi.org/10.1137/120882160","mag":"2569790754"},"language":"en","primary_location":{"id":"doi:10.1137/120882160","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120882160","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5108247017","display_name":"Andre\u012d A. Bulatov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrei A. Bulatov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7868,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86290599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"43","issue":"2","first_page":"573","last_page":"616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9979000091552734,"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/T11567","display_name":"semigroups and automata theory","score":0.9922000169754028,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.893783688545227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6948252320289612},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6658934354782104},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6230586767196655},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5714216828346252},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.488560289144516},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.4751567542552948},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46351659297943115},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.45257893204689026},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43869173526763916},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.431173175573349},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.42187464237213135},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4177413582801819},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.41245436668395996},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3663081228733063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3461785912513733},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.27143704891204834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19755873084068298},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08404499292373657}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.893783688545227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6948252320289612},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6658934354782104},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6230586767196655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5714216828346252},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.488560289144516},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.4751567542552948},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46351659297943115},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.45257893204689026},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43869173526763916},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.431173175573349},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.42187464237213135},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4177413582801819},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.41245436668395996},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3663081228733063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3461785912513733},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.27143704891204834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19755873084068298},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08404499292373657},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120882160","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120882160","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1565722675","https://openalex.org/W1997649256","https://openalex.org/W2008809414","https://openalex.org/W2017619848","https://openalex.org/W2026753685","https://openalex.org/W2032487621","https://openalex.org/W2051627428","https://openalex.org/W2058170847","https://openalex.org/W2061768978","https://openalex.org/W2068190866","https://openalex.org/W2107918022","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2121804749","https://openalex.org/W2123103890","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W3101686253","https://openalex.org/W4240651302"],"related_works":["https://openalex.org/W2784687883","https://openalex.org/W2091348864","https://openalex.org/W2067565196","https://openalex.org/W1509919957","https://openalex.org/W2183565733","https://openalex.org/W2569549435","https://openalex.org/W2074619587","https://openalex.org/W2724280655","https://openalex.org/W2962866002","https://openalex.org/W2152388474"],"abstract_inverted_index":{"In":[0,58,179],"the":[1,17,55,63,70,73,76,81,89,139,148,151,180,196,210,229,246],"constraint":[2,9,103,125,183],"satisfaction":[3],"problem":[4,46,248],"(CSP)":[5],"corresponding":[6],"to":[7,20,26,94,131,235,258],"a":[8,12,30,49,115,122,192,222,250],"language":[10],"(i.e.,":[11],"set":[13,32],"of":[14,24,33,44,52,66,72,80,91,119,142,145,155,182,188,195,200,228,245],"relations)":[15],"$\\Gamma$,":[16],"goal":[18],"is":[19,40,86,99,150,249,256],"find":[21],"an":[22],"assignment":[23],"values":[25,98],"variables":[27,92,108,129],"so":[28],"that":[29,105,208,237],"given":[31],"constraints":[34],"specified":[35],"by":[36,69],"relations":[37],"from":[38],"$\\Gamma$":[39],"satisfied.":[41],"The":[42,241],"complexity":[43,141,244],"this":[45,59,120],"has":[47],"received":[48],"substantial":[50],"amount":[51],"attention":[53],"in":[54,75],"past":[56],"decade.":[57],"paper,":[60],"we":[61,161,190,206,220,231],"study":[62,114,138],"fixed-parameter":[64,197],"tractability":[65],"CSPs":[67,146,201,216],"parameterized":[68,140,167,243],"size":[71,102,203],"solution":[74],"following":[77],"sense:":[78],"one":[79],"possible":[82],"values,":[83],"say":[84],"0,":[85],"\u201cfree,\u201d":[87],"and":[88,165,205],"number":[90,153],"allowed":[93],"take":[95,109],"other,":[96],"\u201cexpensive,\u201d":[97],"restricted.":[100],"A":[101],"requires":[104],"exactly":[106],"$k$":[107,154],"nonzero":[110,156],"values.":[111],"We":[112,137],"also":[113],"more":[116],"refined":[117],"version":[118],"restriction:":[121],"global":[123],"cardinality":[124,218],"prescribes":[126],"how":[127],"many":[128],"have":[130],"be":[132,259],"assigned":[133],"each":[134],"particular":[135],"value.":[136],"these":[143],"types":[144],"where":[147],"parameter":[149],"required":[152],"variables.":[157],"As":[158],"special":[159],"cases,":[160],"can":[162],"obtain":[163,221],"natural":[164],"well-studied":[166],"problems":[168,212,230],"such":[169],"as":[170],"Independent":[171],"set,":[172],"Vertex":[173],"Cover,":[174],"$d$-Hitting":[175],"Set,":[176],"Biclique,":[177],"etc.":[178],"case":[181],"languages":[184],"closed":[185],"under":[186],"substitution":[187],"constants,":[189],"give":[191],"complete":[193],"characterization":[194],"tractable":[198],"cases":[199],"with":[202,217],"constraints,":[204,219],"show":[207,236],"all":[209],"remaining":[211],"are":[213,232,239],"W[1]-hard.":[214,260],"For":[215],"similar":[223],"classification,":[224],"but":[225],"for":[226],"some":[227],"only":[233],"able":[234],"they":[238],"Biclique-hard.":[240],"exact":[242],"Biclique":[247],"notorious":[251],"open":[252],"problem,":[253],"although":[254],"it":[255],"believed":[257]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}