{"id":"https://openalex.org/W2913688336","doi":"https://doi.org/10.1016/s1571-0661(04)00301-9","title":"Parameterized Complexity","display_name":"Parameterized Complexity","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2913688336","doi":"https://doi.org/10.1016/s1571-0661(04)00301-9","mag":"2913688336"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00301-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00301-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)00301-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5054676766"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":133.0675,"has_fulltext":false,"cited_by_count":2914,"citation_normalized_percentile":{"value":0.99992191,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"61","issue":null,"first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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.9344162940979004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7144011855125427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46499836444854736},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"Algorithmic complexity","score":0.44023847579956055},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3531741499900818},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3438825011253357}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9344162940979004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7144011855125427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46499836444854736},{"id":"https://openalex.org/C2983064736","wikidata":"https://www.wikidata.org/wiki/Q20779668","display_name":"Algorithmic complexity","level":2,"score":0.44023847579956055},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3531741499900818},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3438825011253357}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)00301-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00301-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.230.6192","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.6192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/%7Ehermelin/Journal%20Publications/ParamComplexMultiInterval.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00301-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00301-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W67361246","https://openalex.org/W217350247","https://openalex.org/W272087405","https://openalex.org/W1528850355","https://openalex.org/W1539502146","https://openalex.org/W1557597301","https://openalex.org/W1565265107","https://openalex.org/W1607068519","https://openalex.org/W1727001693","https://openalex.org/W1834737061","https://openalex.org/W1836565104","https://openalex.org/W1968650717","https://openalex.org/W1972853793","https://openalex.org/W1999591020","https://openalex.org/W2006204498","https://openalex.org/W2006933117","https://openalex.org/W2007979101","https://openalex.org/W2011039300","https://openalex.org/W2018964411","https://openalex.org/W2020133533","https://openalex.org/W2029943378","https://openalex.org/W2044750317","https://openalex.org/W2046910245","https://openalex.org/W2074210283","https://openalex.org/W2079057772","https://openalex.org/W2090398333","https://openalex.org/W2108136433","https://openalex.org/W2138706770","https://openalex.org/W2147180598","https://openalex.org/W2171554063","https://openalex.org/W2171984098","https://openalex.org/W2394942112","https://openalex.org/W2766186465","https://openalex.org/W4292230561","https://openalex.org/W6609334914","https://openalex.org/W6636293840","https://openalex.org/W6636690859","https://openalex.org/W6650188791"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2053685668","https://openalex.org/W2914625303","https://openalex.org/W1602674403","https://openalex.org/W2883563097","https://openalex.org/W2975536762","https://openalex.org/W2155820407"],"abstract_inverted_index":{"An":[0],"approach":[1],"to":[2,36],"complexity":[3],"theory":[4],"which":[5,41],"offers":[6],"a":[7,62,69],"means":[8],"of":[9,14,24,30,39,65,83,88],"analysing":[10],"algorithms":[11,40,84],"in":[12,22,78],"terms":[13,23],"their":[15],"tractability.":[16],"The":[17,53],"authors":[18],"consider":[19],"the":[20,31,49,79],"problem":[21],"parameterized":[25],"languages":[26],"and":[27,60,74,81],"taking":[28],"k-slices":[29],"language,":[32],"thus":[33],"introducing":[34],"readers":[35],"new":[37],"classes":[38],"may":[42],"be":[43],"analysed":[44],"more":[45],"precisely":[46],"than":[47],"was":[48],"case":[50],"until":[51],"now.":[52],"book":[54],"is":[55],"as":[56,58],"self-contained":[57],"possible":[59],"includes":[61],"great":[63],"deal":[64],"background":[66],"material.":[67],"As":[68],"result,":[70],"computer":[71],"scientists,":[72],"mathematicians,":[73],"graduate":[75],"students":[76],"interested":[77],"design":[80],"analysis":[82],"will":[85],"find":[86],"much":[87],"interest.":[89]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":47},{"year":2020,"cited_by_count":50},{"year":2019,"cited_by_count":48},{"year":2018,"cited_by_count":88},{"year":2017,"cited_by_count":56},{"year":2016,"cited_by_count":101},{"year":2015,"cited_by_count":145},{"year":2014,"cited_by_count":191},{"year":2013,"cited_by_count":295},{"year":2012,"cited_by_count":247}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}