{"id":"https://openalex.org/W2596756838","doi":"https://doi.org/10.3390/a12090188","title":"A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy","display_name":"A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy","publication_year":2019,"publication_date":"2019-09-09","ids":{"openalex":"https://openalex.org/W2596756838","doi":"https://doi.org/10.3390/a12090188","mag":"2596756838"},"language":"en","primary_location":{"id":"doi:10.3390/a12090188","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12090188","pdf_url":"https://www.mdpi.com/1999-4893/12/9/188/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/12/9/188/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068702258","display_name":"Ronald de Haan","orcid":"https://orcid.org/0000-0003-2023-0586"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Ronald de Haan","raw_affiliation_strings":["Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 1000\u20131183 Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 1000\u20131183 Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["Algorithms and Complexity Group, Institute for Logic and Computation, Faculty of Informatics, Technische Universit\u00e4t Wien, 1040 Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, Institute for Logic and Computation, Faculty of Informatics, Technische Universit\u00e4t Wien, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068702258"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.5999,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.6842183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"9","first_page":"188","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9975000023841858,"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/T10142","display_name":"Formal Methods in Verification","score":0.9961000084877014,"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.969872236251831},{"id":"https://openalex.org/keywords/compendium","display_name":"Compendium","score":0.8713920712471008},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.8553657531738281},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.743736982345581},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6290587782859802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5907672047615051},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5660935044288635},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5215432643890381},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4975891411304474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42574864625930786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37734460830688477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3281567692756653},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3087952733039856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1871422529220581}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.969872236251831},{"id":"https://openalex.org/C2778473407","wikidata":"https://www.wikidata.org/wiki/Q1459574","display_name":"Compendium","level":2,"score":0.8713920712471008},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.8553657531738281},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.743736982345581},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6290587782859802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5907672047615051},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5660935044288635},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5215432643890381},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4975891411304474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42574864625930786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37734460830688477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3281567692756653},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3087952733039856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1871422529220581},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3390/a12090188","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12090188","pdf_url":"https://www.mdpi.com/1999-4893/12/9/188/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/0ea26124-bda1-4118-a80f-c152b31c09c6","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy(0ea26124-bda1-4118-a80f-c152b31c09c6).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Haan, R & Szeider, S 2019, 'A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy', Algorithms, vol. 12, no. 9, 188. https://doi.org/10.3390/a12090188","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:openaire/0ea26124-bda1-4118-a80f-c152b31c09c6","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/0ea26124-bda1-4118-a80f-c152b31c09c6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Haan, R & Szeider, S 2019, 'A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy', Algorithms, vol. 12, no. 9, 188. https://doi.org/10.3390/a12090188","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/0ea26124-bda1-4118-a80f-c152b31c09c6","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/a-compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy(0ea26124-bda1-4118-a80f-c152b31c09c6).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:doaj.org/article:9adc8f3407254d1da3e985da5a930817","is_oa":true,"landing_page_url":"https://doaj.org/article/9adc8f3407254d1da3e985da5a930817","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 12, Iss 9, p 188 (2019)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/9/188/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12090188","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a12090188","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12090188","pdf_url":"https://www.mdpi.com/1999-4893/12/9/188/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1002097251","display_name":null,"funder_award_id":"239962","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G2503292058","display_name":null,"funder_award_id":"26200","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6524001194","display_name":null,"funder_award_id":"239962","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G72125511","display_name":null,"funder_award_id":"P26200","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2596756838.pdf","grobid_xml":"https://content.openalex.org/works/W2596756838.grobid-xml"},"referenced_works_count":73,"referenced_works":["https://openalex.org/W9517092","https://openalex.org/W15206906","https://openalex.org/W36639738","https://openalex.org/W56447744","https://openalex.org/W92405270","https://openalex.org/W143512583","https://openalex.org/W150847977","https://openalex.org/W194026504","https://openalex.org/W195515244","https://openalex.org/W1496518193","https://openalex.org/W1498432697","https://openalex.org/W1513023708","https://openalex.org/W1515623105","https://openalex.org/W1517036688","https://openalex.org/W1527197079","https://openalex.org/W1570425181","https://openalex.org/W1628148094","https://openalex.org/W1639901403","https://openalex.org/W1787074469","https://openalex.org/W1879512746","https://openalex.org/W1913003910","https://openalex.org/W1973023438","https://openalex.org/W1973101725","https://openalex.org/W1987890787","https://openalex.org/W1988772559","https://openalex.org/W1996184580","https://openalex.org/W2007464118","https://openalex.org/W2011844594","https://openalex.org/W2031470081","https://openalex.org/W2036265926","https://openalex.org/W2045526507","https://openalex.org/W2050186596","https://openalex.org/W2053094807","https://openalex.org/W2059372025","https://openalex.org/W2065251436","https://openalex.org/W2076698873","https://openalex.org/W2084588073","https://openalex.org/W2089546742","https://openalex.org/W2090039116","https://openalex.org/W2091138122","https://openalex.org/W2100657934","https://openalex.org/W2114785958","https://openalex.org/W2116087731","https://openalex.org/W2131550405","https://openalex.org/W2143893055","https://openalex.org/W2165733306","https://openalex.org/W2170386081","https://openalex.org/W2171811389","https://openalex.org/W2283676177","https://openalex.org/W2401003083","https://openalex.org/W2402068974","https://openalex.org/W2575395113","https://openalex.org/W2577674886","https://openalex.org/W2596756838","https://openalex.org/W2606518309","https://openalex.org/W2913459036","https://openalex.org/W2913688336","https://openalex.org/W2914414140","https://openalex.org/W2963038528","https://openalex.org/W2964181285","https://openalex.org/W2972978374","https://openalex.org/W2998684673","https://openalex.org/W4213368513","https://openalex.org/W4245630182","https://openalex.org/W4292230561","https://openalex.org/W4298227433","https://openalex.org/W6603811047","https://openalex.org/W6629609423","https://openalex.org/W6633989784","https://openalex.org/W6662939423","https://openalex.org/W6679878532","https://openalex.org/W6681000577","https://openalex.org/W6886086314"],"related_works":["https://openalex.org/W2596756838","https://openalex.org/W2998684673","https://openalex.org/W2606518309","https://openalex.org/W1539117866","https://openalex.org/W2041837101","https://openalex.org/W2997249752","https://openalex.org/W1744692106","https://openalex.org/W2158154629","https://openalex.org/W2171811389","https://openalex.org/W2775695328"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,9,16],"list":[3],"of":[4,12,29,38],"parameterized":[5,27],"problems":[6,25,30],"together":[7],"with":[8],"complexity":[10,32],"classification":[11],"whether":[13],"they":[14],"allow":[15],"fixed-parameter":[17],"tractable":[18],"reduction":[19],"to":[20],"SAT":[21],"or":[22,42],"not.":[23],"These":[24],"are":[26],"versions":[28],"whose":[31],"lies":[33],"at":[34],"the":[35,39],"second":[36],"level":[37],"Polynomial":[40],"Hierarchy":[41],"higher.":[43]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}