{"id":"https://openalex.org/W1986957710","doi":"https://doi.org/10.1093/comjnl/bxm047","title":"Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects","display_name":"Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects","publication_year":2007,"publication_date":"2007-03-06","ids":{"openalex":"https://openalex.org/W1986957710","doi":"https://doi.org/10.1093/comjnl/bxm047","mag":"1986957710"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxm047","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm047","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5089274175","display_name":"William Gasarch","orcid":"https://orcid.org/0000-0003-3698-5991"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. Gasarch","raw_affiliation_strings":["University of Maryland at College Park Maryland, USA","University of Marylandat College ParkMaryland, USAEmail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park Maryland, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Marylandat College ParkMaryland, USAEmail:","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049973358","display_name":"Kunikane KIN","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. M. Kin","raw_affiliation_strings":["University of Maryland at College Park Maryland, USA","University of Marylandat College ParkMaryland, USAEmail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park Maryland, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Marylandat College ParkMaryland, USAEmail:","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08395728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"1","first_page":"137","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9886000156402588,"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.9886000156402588,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.974399983882904,"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.8808208107948303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5466476082801819},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5427556037902832},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5423415899276733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.539636492729187},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43234729766845703},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4266647398471832},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.4172009825706482},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4136624336242676},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.41351646184921265},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4126593768596649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4078238904476166},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3435099124908447},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14116820693016052}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8808208107948303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5466476082801819},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5427556037902832},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5423415899276733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.539636492729187},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43234729766845703},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4266647398471832},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.4172009825706482},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4136624336242676},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.41351646184921265},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4126593768596649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4078238904476166},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3435099124908447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14116820693016052},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxm047","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm047","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"}],"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/W1986447712","https://openalex.org/W2110193191","https://openalex.org/W4389156785","https://openalex.org/W3134175203","https://openalex.org/W2113885662","https://openalex.org/W3002909018","https://openalex.org/W2914832887","https://openalex.org/W2177663427","https://openalex.org/W4384270378","https://openalex.org/W2585468647"],"abstract_inverted_index":{"There":[0,48],"are":[1,57,66,176,239],"several":[2],"ways":[3],"around":[4],"the":[5,23,35,53,68,76,112,151,162,207,225,247],"all-too-common":[6],"\u2018bad":[7],"news\u2019":[8],"of":[9,38,67,122,190,198,209,215,221,227],"NP-completeness.":[10],"To":[11],"name":[12],"two":[13],"prominent":[14,138],"algorithmic":[15,213],"strategies:":[16],"(i)":[17],"one":[18,26,137],"can":[19,27,182],"look":[20,28],"into":[21,29],"approximating":[22],"solution;":[24],"(ii)":[25],"algorithms":[30,96,105,181,197],"that":[31,52,230],"work":[32],"well":[33],"on":[34,111,118,156,159],"particular":[36],"kind":[37],"instances":[39],"likely":[40],"to":[41,169],"be":[42,170],"encountered,":[43],"also":[44],"known":[45,203],"as":[46],"heuristics.":[47],"is":[49,73,84,144,165,167],"another":[50],"approach":[51],"books":[54],"under":[55,250],"consideration":[56],"about,":[58],"called":[59,241],"Fixed":[60,242],"Parameter":[61,243],"Tractability.":[62],"Many":[63],"NP-complete":[64],"problems":[65,121,223,238],"form":[69],"...":[70],"If":[71],"k":[72],"fixed":[74,141],"then":[75],"problem":[77,135],"Ak":[78],"=":[79],"{G|G":[80],"has":[81],"property":[82],"P(k)}":[83],"often":[85],"solvable":[86],"in":[87,90,147,172,246],"polynomial":[88,109],"time,":[89],"many":[91],"cases":[92],"by":[93],"trivial,":[94],"brute-force":[95],"that,":[97],"for":[98,140,184],"example,":[99],"\u2018try":[100],"all":[101],"k-subsets\u2019.":[102],"Such":[103,236],"naive":[104],"typically":[106],"yield":[107],"a":[108,145,234],"bound":[110],"running":[113],"time":[114,148],"whose":[115],"exponent":[116],"depends":[117],"k.":[119,157],"Some":[120],"this":[123,199,232],"form,":[124],"however,":[125],"admit":[126],"clever,":[127],"and":[128,193,204],"sometimes":[129],"extremely":[130],"deep":[131],"algorithms\u2014the":[132],"Graph":[133],"Minors":[134],"being":[136],"example\u2014where,":[139],"k,":[142,173,191],"there":[143],"solution":[146],"O(f(k)nO(1)).":[149],"Here,":[150],"O(1)":[152],"does":[153],"not":[154],"depend":[155],"Depending":[158],"how":[160],"bad":[161],"function":[163],"f":[164],"(which":[166],"expected":[168],"exponential":[171],"since":[174,206],"we":[175],"discussing":[177],"NP-hard":[178],"problems),":[179],"such":[180],"be,":[183],"small":[185],"(and":[186],"even":[187],"moderate)":[188],"values":[189],"fast":[192],"useful.":[194],"Indeed,":[195],"practical":[196],"sort":[200],"have":[201],"been":[202],"used":[205],"beginnings":[208],"Computer":[210],"Science.":[211],"The":[212],"practice":[214],"cleverly":[216],"exploiting":[217],"limited":[218],"natural":[219],"parameters":[220],"computational":[222],"predates":[224],"theory":[226,249],"parameterized":[228,237],"complexity":[229],"\u2018gave":[231],"phenomenon":[233],"name\u2019.":[235],"now":[240],"Tractable":[244],"(FPT),":[245],"mathematical":[248],"discussion.":[251]},"counts_by_year":[],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}