[Taken] Entry into the PACE Parameterized Algorithms and Computational Experiments Challenge

Parameterized Complexity is a research field that, by its own self-description, strives to provide practical, yet theoretically well-founded ways to deal with computationally hard problems (e.g., so-called NP-hard problems). However, the vast majority of the work in the field is purely theoretical — there is a great toolbox of interesting and powerful algorithmic methods, which have been proven to have … full description “[Taken] Entry into the PACE Parameterized Algorithms and Computational Experiments Challenge”