{"id":"https://openalex.org/W1528850355","doi":"https://doi.org/10.1007/3-540-48224-5_23","title":"Subexponential Parameterized Algorithms Collapse the W-Hierarchy","display_name":"Subexponential Parameterized Algorithms Collapse the W-Hierarchy","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1528850355","doi":"https://doi.org/10.1007/3-540-48224-5_23","mag":"1528850355"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_23","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5012513857","display_name":"Liming Cai","orcid":"https://orcid.org/0000-0002-8982-2435"},"institutions":[{"id":"https://openalex.org/I4210106879","display_name":"Ohio University","ror":"https://ror.org/01jr3y717","country_code":"US","type":"education","lineage":["https://openalex.org/I4210106879"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liming Cai","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Ohio University, Athens, OH, 45701"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Ohio University, Athens, OH, 45701","institution_ids":["https://openalex.org/I4210106879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020524364","display_name":"David Juedes","orcid":"https://orcid.org/0000-0002-1656-5781"},"institutions":[{"id":"https://openalex.org/I4210106879","display_name":"Ohio University","ror":"https://ror.org/01jr3y717","country_code":"US","type":"education","lineage":["https://openalex.org/I4210106879"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Juedes","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Ohio University, Athens, OH, 45701"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Ohio University, Athens, OH, 45701","institution_ids":["https://openalex.org/I4210106879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210106879"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.979,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.96256434,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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/T10142","display_name":"Formal Methods in Verification","score":0.9803000092506409,"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.9684854745864868},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8093534111976624},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5458004474639893},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.544786274433136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5437816381454468},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5416799187660217},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5406190752983093},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5379204750061035},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5012147426605225},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4936724603176117},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.49069273471832275},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.4793201684951782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47466209530830383},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4536319971084595},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41178059577941895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3967721462249756},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3803722858428955},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3777415156364441},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11189055442810059}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9684854745864868},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8093534111976624},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5458004474639893},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.544786274433136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5437816381454468},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5416799187660217},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5406190752983093},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5379204750061035},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5012147426605225},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4936724603176117},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.49069273471832275},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.4793201684951782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47466209530830383},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4536319971084595},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41178059577941895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3967721462249756},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3803722858428955},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3777415156364441},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11189055442810059},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-48224-5_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_23","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W204341840","https://openalex.org/W272087405","https://openalex.org/W1557597301","https://openalex.org/W1598441350","https://openalex.org/W1684108869","https://openalex.org/W1967415230","https://openalex.org/W1972577597","https://openalex.org/W2006933117","https://openalex.org/W2011039300","https://openalex.org/W2020133533","https://openalex.org/W2038225707","https://openalex.org/W2043997666","https://openalex.org/W2061513598","https://openalex.org/W2125065856","https://openalex.org/W2156760067","https://openalex.org/W2170009211","https://openalex.org/W2913688336","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2886237949","https://openalex.org/W2952288771","https://openalex.org/W4289276807","https://openalex.org/W2168711306","https://openalex.org/W2145388251","https://openalex.org/W4388999007","https://openalex.org/W2949267003","https://openalex.org/W1597649928","https://openalex.org/W1759554648","https://openalex.org/W2141946535"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}