@article{3ab289fbb0bd4841ad7dc5f06d4b21d1,
title = "Special issue {"}new frontiers in parameterized complexity and algorithms{"}: Foreward by the guest editors",
abstract = "This Special Issue contains eleven articles-surveys and research papers-that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to bridging the gap between theory and practice. The scope and impact of the field continues to increase. Promising avenues and new research challenges are highlighted in this Special Issue.",
keywords = "ETH/SETH, FPT, Fine-grained, Heuristics, Kernelization, Lower bounds, Parameterized complexity, Turbo-charged",
author = "Neeldhara Misra and Frances Rosamond and Meirav Zehavi",
note = "Funding Information: Funding: The Norwegian NFR Toppforsk PCPC Project, The Bergen (BFS) Toppforsk; Israel Science Foundation grant no. 1176/18; United States-Israel Binational Science Foundation grant no. 2018302. Funding Information: Parameterized Complexity has developed strongly and there is a long way to go, as evidenced by the directions of the papers in this Special Issue. The high-quality research in the field has been recognized by funding agencies (ERC, NSF, many national research councils), by research fellowships (EATCS, ACM, Marie Curie, Lise Meitner and others), by memberships in Royal Societies, Academy Europaea, and Academy of Science in various countries, and by prizes and awards (Humboldt Research Prize, Witold Lipski Prize, Krill Prize, NSF Career and others). Foundational papers are evinced in a broad sweep of areas including AI, Access Control, Business, Bioinformatics, Computational Geometry, Computational Social Choice, Cognitive Science, Computational Medicine, Machine Learning, Phylogeny, Psychology, Operations Research and Scheduling, with many Best Paper Awards. About 8% of papers in top theoretical computer science conferences are related to Parameterized Complexity. Since 2015, the annual Parameterized Algorithms and Computational Experiments Challenge (PACE) has served to deepen the relationship between parameterized algorithms and practice, and help bridge the divide between the theory of algorithm design and analysis, and the practice of algorithm engineering, as well as inspire new theoretical developments. Books in the field include Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (de Haan 2020). Two new books were published in 2019: Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis (Iris van Rooij, et al. 2019), and Kernelization: Theory of Parameterized Preprocessing (Fomin et al. 2019). Many open problems remain that were proposed in Parameterized Complexity, 1999 and Foundations of Parameterized Complexity, 2013 (Downey and Fellows), Invitation to Fixed-Parameter Algorithms (Niedermeier 2002), Parameterized Complexity Theory (Flum, Grohe 2006), and Parameterized Algorithms Publisher Copyright: {\textcopyright} 2020 by the authors.",
year = "2020",
month = sep,
day = "1",
doi = "https://doi.org/10.3390/A13090236",
language = "English",
volume = "13",
journal = "Algorithms",
issn = "1999-4893",
publisher = "MDPI AG",
number = "9",
}