{"id":"https://openalex.org/W2089158353","doi":"https://doi.org/10.1137/080742270","title":"Intractability of Clique-Width Parameterizations","display_name":"Intractability of Clique-Width Parameterizations","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2089158353","doi":"https://doi.org/10.1137/080742270","mag":"2089158353"},"language":"en","primary_location":{"id":"doi:10.1137/080742270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080742270","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/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4210108340","display_name":"University of International Business","ror":"https://ror.org/01rvqzw67","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210108340"]}],"countries":["KZ"],"is_corresponding":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["fedor.fomin@ii.uib.no and daniello@ii.uib.no#TAB#"],"affiliations":[{"raw_affiliation_string":"fedor.fomin@ii.uib.no and daniello@ii.uib.no#TAB#","institution_ids":["https://openalex.org/I4210108340"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["petr.golovach@durham.ac.uk#TAB#"],"affiliations":[{"raw_affiliation_string":"petr.golovach@durham.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["saket@imsc.res.in#TAB#"],"affiliations":[{"raw_affiliation_string":"saket@imsc.res.in#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4210108340"],"apc_list":null,"apc_paid":null,"fwci":4.7837,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.95135935,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"39","issue":"5","first_page":"1941","last_page":"1956"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9628000259399414,"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/T12534","display_name":"Protein Degradation and Inhibitors","score":0.9326000213623047,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9234015345573425},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8161017894744873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6531940698623657},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5876826643943787},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5309065580368042},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5188725590705872},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4910261631011963},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48012566566467285},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4665994644165039},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4620700478553772},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4611196219921112},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4453248083591461},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.42211610078811646},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.24638938903808594},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1097988486289978},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.08133530616760254},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06213858723640442},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.06026029586791992}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9234015345573425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8161017894744873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6531940698623657},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5876826643943787},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5309065580368042},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5188725590705872},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4910261631011963},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48012566566467285},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4665994644165039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4620700478553772},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4611196219921112},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4453248083591461},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.42211610078811646},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.24638938903808594},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1097988486289978},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.08133530616760254},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06213858723640442},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.06026029586791992}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/080742270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080742270","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.1712","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.1712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~daniello/papers/cliquewidth.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.4492","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.4492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Efomin/articles/2010/2010a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W182050876","https://openalex.org/W1500603002","https://openalex.org/W1546876109","https://openalex.org/W1570425181","https://openalex.org/W1586912793","https://openalex.org/W1606469315","https://openalex.org/W1993328543","https://openalex.org/W1995561296","https://openalex.org/W2008361472","https://openalex.org/W2013967419","https://openalex.org/W2019673912","https://openalex.org/W2019880676","https://openalex.org/W2035344492","https://openalex.org/W2035362312","https://openalex.org/W2043791970","https://openalex.org/W2053991811","https://openalex.org/W2059372025","https://openalex.org/W2063951771","https://openalex.org/W2064796716","https://openalex.org/W2070790034","https://openalex.org/W2076853283","https://openalex.org/W2087083200","https://openalex.org/W2087911394","https://openalex.org/W2109716789","https://openalex.org/W2112067601","https://openalex.org/W2140285470","https://openalex.org/W2171507355","https://openalex.org/W2913688336","https://openalex.org/W3021394452","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2219991221","https://openalex.org/W1560842054","https://openalex.org/W2035637517","https://openalex.org/W2109391260","https://openalex.org/W154317836","https://openalex.org/W2186006531","https://openalex.org/W3037934538","https://openalex.org/W3020410572","https://openalex.org/W2089690069","https://openalex.org/W2912904283"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,40,64],"Edge":[3],"Dominating":[4],"Set,":[5],"Hamiltonian":[6],"Cycle,":[7],"and":[8],"Graph":[9],"Coloring":[10],"are":[11],"$W[1]$-hard":[12],"parameterized":[13,36,88],"by":[14,37],"clique-width.":[15],"It":[16],"was":[17],"an":[18],"open":[19],"problem,":[20],"explicitly":[21],"mentioned":[22],"in":[23,43],"several":[24],"papers,":[25],"whether":[26],"any":[27],"of":[28,50,58,69],"these":[29],"problems":[30],"is":[31,55,73],"fixed":[32],"parameter":[33],"tractable":[34],"when":[35],"the":[38,65,75],"clique-width,":[39],"is,":[41],"solvable":[42],"time":[44,67],"$g(k)\\cdot":[45],"n^{O(1)}$":[46],"on":[47],"n-vertex":[48],"graphs":[49],"clique-width":[51],"k,":[52],"where":[53],"g":[54],"some":[56],"function":[57],"k":[59],"only.":[60],"Our":[61],"results":[62],"imply":[63],"running":[66],"$O(n^{f(k)})$":[68],"many":[70],"clique-width-based":[71],"algorithms":[72],"essentially":[74],"best":[76],"we":[77],"can":[78],"hope":[79],"for":[80],"(up":[81],"to":[82],"a":[83],"widely":[84],"believed":[85],"assumption":[86],"from":[87],"complexity,":[89],"namely":[90],"$FPT\\neq":[91],"W[1]$).":[92]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}