{"id":"https://openalex.org/W2949142592","doi":"https://doi.org/10.1145/3310228","title":"Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs","display_name":"Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs","publication_year":2019,"publication_date":"2019-06-07","ids":{"openalex":"https://openalex.org/W2949142592","doi":"https://doi.org/10.1145/3310228","mag":"2949142592"},"language":"en","primary_location":{"id":"doi:10.1145/3310228","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3310228","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5020955386","display_name":"David Coudert","orcid":"https://orcid.org/0000-0002-3306-8314"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"David Coudert","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d\u2019Azur, Inria, CNRS, I3S, Sophia Antipolis Cedex, France","COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d\u2019Azur, Inria, CNRS, I3S, Sophia Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020003818","display_name":"Guillaume Ducoffe","orcid":"https://orcid.org/0000-0003-2127-5989"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research and Development in Informatics - ICI Bucharest","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Guillaume Ducoffe","raw_affiliation_strings":["National Institute for Research and Development in Informatics 8 University of Bucharest, Faculty of Mathematics and Computer Science 8 The Research Institute of the University of Bucharest ICUB, Bucure\u015fti, Romania","ICI - National Institute for Research and Development in Informatics [Bucharest] (8-10, Mare\u015fal Averescu, 011455, Bucharest - Romania)","COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","ICUB - Research Institute of the University of Bucharest (36-46 Bd. M. Kogalniceanu, 5th District, 050107, Bucharest - Romania)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute for Research and Development in Informatics 8 University of Bucharest, Faculty of Mathematics and Computer Science 8 The Research Institute of the University of Bucharest ICUB, Bucure\u015fti, Romania","institution_ids":["https://openalex.org/I4210114681"]},{"raw_affiliation_string":"ICI - National Institute for Research and Development in Informatics [Bucharest] (8-10, Mare\u015fal Averescu, 011455, Bucharest - Romania)","institution_ids":["https://openalex.org/I4210114681"]},{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]},{"raw_affiliation_string":"ICUB - Research Institute of the University of Bucharest (36-46 Bd. M. Kogalniceanu, 5th District, 050107, Bucharest - Romania)","institution_ids":["https://openalex.org/I141595442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008143115","display_name":"Alexandru Popa","orcid":"https://orcid.org/0000-0003-3364-1210"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research and Development in Informatics - ICI Bucharest","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Alexandru Popa","raw_affiliation_strings":["National Institute for Research and Development in Informatics 8 University of Bucharest, Faculty of Mathematics and Computer Science, Bucure\u015fti, Romania","UniBuc - University of Bucharest (90, Panduri Street, Sector 5, 050663, Bucharest - Romania)","ICI - National Institute for Research and Development in Informatics [Bucharest] (8-10, Mare\u015fal Averescu, 011455, Bucharest - Romania)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute for Research and Development in Informatics 8 University of Bucharest, Faculty of Mathematics and Computer Science, Bucure\u015fti, Romania","institution_ids":["https://openalex.org/I4210114681"]},{"raw_affiliation_string":"UniBuc - University of Bucharest (90, Panduri Street, Sector 5, 050663, Bucharest - Romania)","institution_ids":["https://openalex.org/I141595442"]},{"raw_affiliation_string":"ICI - National Institute for Research and Development in Informatics [Bucharest] (8-10, Mare\u015fal Averescu, 011455, Bucharest - Romania)","institution_ids":["https://openalex.org/I4210114681"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020955386"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":6.2666,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.96859724,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"57"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5932393074035645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5914356708526611},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5737600326538086},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5405145883560181},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5360690951347351},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.520313024520874},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.5119441747665405},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5091151595115662},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49389320611953735},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4662564992904663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45391422510147095},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4501028060913086},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.44704583287239075},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.44348886609077454},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42681825160980225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40741100907325745},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.37644827365875244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2407381534576416},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2312900424003601},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1626870334148407},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.11678662896156311}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5932393074035645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5914356708526611},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5737600326538086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5405145883560181},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5360690951347351},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.520313024520874},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.5119441747665405},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5091151595115662},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49389320611953735},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4662564992904663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45391422510147095},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4501028060913086},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.44704583287239075},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44348886609077454},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42681825160980225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40741100907325745},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.37644827365875244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2407381534576416},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2312900424003601},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1626870334148407},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.11678662896156311},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3310228","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3310228","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01562413v2","is_oa":false,"landing_page_url":"https://hal.science/hal-01562413","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] Inria - Sophia antipolis; Universite Cote d'Azur; University of Bucharest, Faculty of Mathematics and Computer Science; National Institute for Research and Development in Informatics, Romania. 2017, pp.1-60","raw_type":"Reports"},{"id":"pmh:oai:HAL:hal-02152971v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02152971","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 2019, 15 (3), pp.1-57. ⟨10.1145/3310228⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8042030181","display_name":null,"funder_award_id":"PN1819-01-01 and 17PCCDI/2018","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"},{"id":"https://openalex.org/G8173586285","display_name":null,"funder_award_id":"ANR-15-IDEX-01","funder_id":"https://openalex.org/F4320325505","funder_display_name":"Agence Nationale pour le D\u00e9veloppement de la Recherche Universitaire"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"},{"id":"https://openalex.org/F4320325505","display_name":"Agence Nationale pour le D\u00e9veloppement de la Recherche Universitaire","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":123,"referenced_works":["https://openalex.org/W163370848","https://openalex.org/W383755372","https://openalex.org/W404522508","https://openalex.org/W1499093134","https://openalex.org/W1504895562","https://openalex.org/W1545635390","https://openalex.org/W1546876109","https://openalex.org/W1562378785","https://openalex.org/W1586912793","https://openalex.org/W1591789561","https://openalex.org/W1632774644","https://openalex.org/W1684108869","https://openalex.org/W1774449376","https://openalex.org/W1826325207","https://openalex.org/W1966596093","https://openalex.org/W1971937094","https://openalex.org/W1972094496","https://openalex.org/W1972417560","https://openalex.org/W1976120600","https://openalex.org/W1977820238","https://openalex.org/W1978145399","https://openalex.org/W1984837166","https://openalex.org/W1993328543","https://openalex.org/W1994887153","https://openalex.org/W1995739513","https://openalex.org/W1998509117","https://openalex.org/W1999145171","https://openalex.org/W2000763343","https://openalex.org/W2003813631","https://openalex.org/W2008816808","https://openalex.org/W2015142920","https://openalex.org/W2015516462","https://openalex.org/W2015906942","https://openalex.org/W2019030165","https://openalex.org/W2022499468","https://openalex.org/W2026055698","https://openalex.org/W2026807383","https://openalex.org/W2028357390","https://openalex.org/W2028452681","https://openalex.org/W2028503265","https://openalex.org/W2029448190","https://openalex.org/W2030776771","https://openalex.org/W2038865230","https://openalex.org/W2040514941","https://openalex.org/W2041910029","https://openalex.org/W2043247113","https://openalex.org/W2046635105","https://openalex.org/W2047281923","https://openalex.org/W2047489708","https://openalex.org/W2048652909","https://openalex.org/W2053469126","https://openalex.org/W2053991811","https://openalex.org/W2059608229","https://openalex.org/W2062510888","https://openalex.org/W2063951771","https://openalex.org/W2064909166","https://openalex.org/W2065295938","https://openalex.org/W2066867008","https://openalex.org/W2067475075","https://openalex.org/W2077462389","https://openalex.org/W2078319547","https://openalex.org/W2079306871","https://openalex.org/W2081231398","https://openalex.org/W2083116175","https://openalex.org/W2084803275","https://openalex.org/W2087083200","https://openalex.org/W2087911394","https://openalex.org/W2088523331","https://openalex.org/W2089158353","https://openalex.org/W2096882055","https://openalex.org/W2105085476","https://openalex.org/W2106818977","https://openalex.org/W2108354262","https://openalex.org/W2115857747","https://openalex.org/W2141641104","https://openalex.org/W2142055019","https://openalex.org/W2145937415","https://openalex.org/W2146507303","https://openalex.org/W2150123893","https://openalex.org/W2154682992","https://openalex.org/W2171707538","https://openalex.org/W2256089709","https://openalex.org/W2293041988","https://openalex.org/W2298080458","https://openalex.org/W2404196336","https://openalex.org/W2489437981","https://openalex.org/W2525301097","https://openalex.org/W2525909498","https://openalex.org/W2561675875","https://openalex.org/W2591578573","https://openalex.org/W2592125861","https://openalex.org/W2592637533","https://openalex.org/W2596114558","https://openalex.org/W2601439810","https://openalex.org/W2613078218","https://openalex.org/W2617953066","https://openalex.org/W2735449077","https://openalex.org/W2772612740","https://openalex.org/W2798588639","https://openalex.org/W2798949156","https://openalex.org/W2892948282","https://openalex.org/W2900958825","https://openalex.org/W2906924999","https://openalex.org/W2913688336","https://openalex.org/W2949142592","https://openalex.org/W2950547567","https://openalex.org/W2951185106","https://openalex.org/W2962759123","https://openalex.org/W2962815948","https://openalex.org/W2962968573","https://openalex.org/W2963360194","https://openalex.org/W3005016500","https://openalex.org/W3103297958","https://openalex.org/W3104783836","https://openalex.org/W3135299686","https://openalex.org/W4213071546","https://openalex.org/W4230551286","https://openalex.org/W4233756358","https://openalex.org/W4243936346","https://openalex.org/W4249997060","https://openalex.org/W4285719527","https://openalex.org/W4298198698","https://openalex.org/W4299364280"],"related_works":["https://openalex.org/W3135652805","https://openalex.org/W2800485060","https://openalex.org/W4220735480","https://openalex.org/W3022168212","https://openalex.org/W4302399289","https://openalex.org/W1584965761","https://openalex.org/W1541872440","https://openalex.org/W4319653989","https://openalex.org/W2949142592","https://openalex.org/W2735449077"],"abstract_inverted_index":{"Recently,":[0],"hardness":[1,80,97],"results":[2,81,98],"for":[3,78,132,162],"problems":[4,26,44,77,86,89],"in":[5,51,122],"P":[6,148],"were":[7],"achieved":[8],"using":[9,102,175],"reasonable":[10],"complexity-theoretic":[11],"assumptions":[12],"such":[13,83,165],"as":[14,84,110,166],"the":[15,39,42,52,141,144,147],"Strong":[16],"Exponential":[17],"Time":[18],"Hypothesis.":[19],"According":[20],"to":[21,37,59,67,187],"these":[22],"assumptions,":[23],"many":[24,154],"graph-theoretic":[25,76],"do":[27],"not":[28],"admit":[29],"truly":[30],"subquadratic":[31],"algorithms.":[32],"A":[33],"central":[34],"technique":[35,58],"used":[36],"tackle":[38],"difficulty":[40],"of":[41,106,143],"above-mentioned":[43],"is":[45,119,139],"fixed-parameter":[46],"algorithms":[47,155,169],"with":[48,191],"polynomial":[49],"dependency":[50],"fixed":[53],"parameter":[54],"(P-FPT).":[55],"Applying":[56],"this":[57,71],"clique-width":[60,103],",":[61,87,90],"an":[62,120],"important":[63,117],"graph":[64,145,189],"parameter,":[65],"remained":[66],"be":[68,185],"done.":[69],"In":[70],"article,":[72],"we":[73],"study":[74],"several":[75],"which":[79],"exist":[82],"cycle":[85],"distance":[88],"and":[91,99,104,178],"maximum":[92,135],"matching":[93],".":[94],"We":[95,112],"give":[96],"P-FPT":[100],"algorithms,":[101],"some":[105,188],"its":[107],"upper":[108],"bounds":[109],"parameters.":[111],"believe":[113],"that":[114,156],"our":[115],"most":[116],"result":[118],"algorithm":[121],"O":[123],"(":[124],"k":[125,138],"4":[126,149],"\u22c5":[127],"n":[128],"+":[129],"m":[130],")-time":[131],"computing":[133],"a":[134],"matching,":[136],"where":[137],"either":[140],"modular-width":[142],"or":[146],"-sparseness.":[150],"The":[151],"latter":[152],"generalizes":[153],"have":[157],"been":[158],"introduced":[159],"so":[160],"far":[161],"specific":[163],"subclasses":[164],"cographs.":[167],"Our":[168],"are":[170],"based":[171],"on":[172],"preprocessing":[173],"methods":[174],"modular":[176],"decomposition":[177],"split":[179],"decomposition.":[180],"Thus":[181],"they":[182],"can":[183],"also":[184],"generalized":[186],"classes":[190],"unbounded":[192],"clique-width.":[193]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}