{"id":"https://openalex.org/W3128546480","doi":"https://doi.org/10.3233/faia201000","title":"Chapter 17. Fixed-Parameter Tractability","display_name":"Chapter 17. Fixed-Parameter Tractability","publication_year":2021,"publication_date":"2021-02-02","ids":{"openalex":"https://openalex.org/W3128546480","doi":"https://doi.org/10.3233/faia201000","mag":"3128546480"},"language":"en","primary_location":{"id":"doi:10.3233/faia201000","is_oa":false,"landing_page_url":"https://doi.org/10.3233/faia201000","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5021237641","display_name":"Marko Samer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marko Samer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021237641"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7297,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89917023,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9713000059127808,"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.9713000059127808,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9367771744728088},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6653237342834473},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5584654808044434},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5459619164466858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5455408096313477},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5322667956352234},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.47068458795547485},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41565704345703125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33998894691467285},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3298932909965515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27043581008911133},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12223604321479797}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9367771744728088},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6653237342834473},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5584654808044434},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5459619164466858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5455408096313477},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5322667956352234},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.47068458795547485},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41565704345703125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33998894691467285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3298932909965515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27043581008911133},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12223604321479797},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia201000","is_oa":false,"landing_page_url":"https://doi.org/10.3233/faia201000","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004","https://openalex.org/W4301903827"],"abstract_inverted_index":{"Parameterized":[0],"complexity":[1,20,33,89],"is":[2,47,73],"a":[3,22,31],"new":[4],"theoretical":[5],"framework":[6],"that":[7,35,65,100],"considers,":[8],"in":[9,54,102],"addition":[10],"to":[11,52,117],"the":[12,16,25,62,66,69,76,87,91,106,110,123],"overall":[13],"input":[14],"size,":[15],"effects":[17],"on":[18,86],"computational":[19],"of":[21,39,61,68,75,90,112,125,128],"secondary":[23],"measurement,":[24],"parameter.":[26,77],"This":[27,78],"two-dimensional":[28],"viewpoint":[29],"allows":[30],"fine-grained":[32],"analysis":[34],"takes":[36],"structural":[37],"properties":[38],"problem":[40,93],"instances":[41],"into":[42],"account.":[43],"The":[44],"central":[45],"notion":[46],"\u201cfixed-parameter":[48],"tractability\u201d":[49],"which":[50],"refers":[51],"solvability":[53],"polynomial":[55,70],"time":[56,71],"for":[57],"each":[58],"fixed":[59],"value":[60],"parameter":[63],"such":[64],"order":[67],"bound":[72],"independent":[74],"chapter":[79],"presents":[80],"main":[81],"concepts":[82],"and":[83,94,122],"recent":[84],"results":[85],"parameterized":[88],"satisfiability":[92,129],"it":[95],"outlines":[96],"fundamental":[97],"algorithmic":[98],"ideas":[99],"arise":[101],"this":[103],"context.":[104],"Among":[105],"parameters":[107],"considered":[108],"are":[109],"size":[111],"backdoor":[113],"sets":[114],"with":[115],"respect":[116],"various":[118],"tractable":[119],"base":[120],"classes":[121],"treewidth":[124],"graph":[126],"representations":[127],"instances.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}