{"id":"https://openalex.org/W272087405","doi":"https://doi.org/10.1090/dimacs/049/04","title":"Parameterized complexity: A framework for systematically confronting computational intractability","display_name":"Parameterized complexity: A framework for systematically confronting computational intractability","publication_year":1999,"publication_date":"1999-05-18","ids":{"openalex":"https://openalex.org/W272087405","doi":"https://doi.org/10.1090/dimacs/049/04","mag":"272087405"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/049/04","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/049/04","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","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/A5071503687","display_name":"Rodney G. Downey","orcid":"https://orcid.org/0000-0003-4381-2845"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rodney Downey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Fellows","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5063629937","display_name":"Ulrike Stege","orcid":"https://orcid.org/0000-0001-9466-7196"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ulrike Stege","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":11.8409,"has_fulltext":false,"cited_by_count":192,"citation_normalized_percentile":{"value":0.99051008,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.894599974155426,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.894599974155426,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.8937000036239624,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.8737999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9619792103767395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5793297290802002},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4899984896183014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2216261327266693}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9619792103767395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5793297290802002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4899984896183014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2216261327266693}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/049/04","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/049/04","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.4079","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.4079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mcs.vuw.ac.nz/math/papers/pcomplex.ps","raw_type":"text"}],"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/W2357085366","https://openalex.org/W4295676998","https://openalex.org/W2914625303","https://openalex.org/W200564616","https://openalex.org/W2053685668","https://openalex.org/W642500026","https://openalex.org/W2404201279","https://openalex.org/W2121249560","https://openalex.org/W3037233674","https://openalex.org/W4289702104"],"abstract_inverted_index":{"In":[0,62,105],"this":[1,110,150],"paper":[2],"we":[3,64,112],"give":[4,25],"a":[5,74,148,187],"programmatic":[6],"overview":[7],"of":[8,16,19,28,59,89,108,139,168,179,195],"parameterized":[9,85,126,197,202],"computational":[10,22],"complexity":[11,198],"in":[12,37,56,128,217],"the":[13,17,57,79,87,106,134,137,140,166,192,196,200,227,235],"broad":[14],"context":[15],"problem":[18,84,127,205],"coping":[20],"with":[21,209],"intractability.":[23],"We":[24,120,163,185],"some":[26,115],"examples":[27],"how":[29,165],"fixed-parameter":[30],"tractability":[31],"techniques":[32],"can":[33,170],"deliver":[34],"practical":[35,75],"algorithms":[36,46],"two":[38],"different":[39],"ways:":[40],"(1)":[41],"by":[42,53,86,214,220],"providing":[43,54],"useful":[44],"exact":[45],"for":[47,71,78,98,144,155,160,223],"small":[48],"parameter":[49,135],"ranges,":[50],"and":[51,94,117,176],"(2)":[52],"guidance":[55],"design":[58],"heuristic":[60],"algorithms.":[61],"particular,":[63],"describe":[65,164,186],"an":[66,123],"improved":[67],"FPT":[68,76,103,183],"kernelization":[69],"algorithm":[70,77],"Vertex":[72],"Cover,":[73],"Maximum":[80],"Agreement":[81],"Subtree":[82],"(MAST)":[83],"number":[88],"species":[90],"to":[91,173,181,211],"be":[92,171,207],"deleted,":[93],"new":[95],"general":[96],"heuristics":[97],"these":[99],"problems":[100,178],"based":[101],"on":[102],"techniques.":[104],"course":[107],"making":[109],"overview,":[111],"also":[113],"investigate":[114],"structural":[116,189],"hardness":[118,222],"issues.":[119],"prove":[121],"that":[122,152],"important":[124],"naturally":[125,201],"artificial":[129],"intelligence,":[130],"STRIPS":[131,174],"Planning":[132,175],"(where":[133],"is":[136,142,158],"size":[138],"plan)":[141],"complete":[143,159],"W":[145,161],"[1].":[146,162],"As":[147],"corollary,":[149],"implies":[151],"k-Step":[153],"Reachability":[154],"Petri":[156],"Nets":[157],"concept":[167],"treewidth":[169],"applied":[172],"other":[177],"logic":[180],"obtain":[182],"results.":[184],"surprising":[188],"result":[190],"concerning":[191],"top":[193],"end":[194],"hierarchy:":[199],"Graph":[203],"k-Coloring":[204],"cannot":[206],"resolved":[208],"respect":[210],"XP":[212,224],"either":[213],"showing":[215,221],"membership":[216],"XP,":[218],"or":[219,234],"without":[225],"settling":[226],"P":[228],"=":[229],"NP":[230],"question":[231],"one":[232],"way":[233],"other.":[236]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}