The Parameterized Algorithms and Computational Experiments Challenge (PACE) was conceived in Fall 2015 to deepen the relationship between parameterized algorithms and practice. Topics from multivariate algorithms, exact algorithms, fine-grained complexity, and related fields are in scope.
PACE aims to:
- Bridge the divide between the theory of algorithm design and analysis, and the practice of algorithm engineering
- Inspire new theoretical developments
- Investigate in how far theoretical algorithms from parameterized complexity and related fields are competitive in practice
- Produce universally accessible libraries of implementations and repositories of benchmark instances
- Encourage the dissemination of these findings in scientific papers
- (since 2017) Édouard Bonnet (LIP, ENS Lyon)
- (since 2016) Holger Dell (Goethe University Frankfurt and IT University of Copenhagen)
- (since 2019) Johannes Fichte (Technische Universität Dresden)
- (since 2019) Markus Hecher (Technische Universität Wien)
- (since 2016) Bart M. P. Jansen (chair) (Eindhoven University of Technology)
- (since 2020) Łukasz Kowalik (University of Warsaw)
- (since 2020) Marcin Pilipczuk (University of Warsaw)
- (since 2020) Manuel Sorge (Technische Universität Wien)
- (2016-2019) Thore Husfeldt (IT University of Copenhagen and Lund University)
- (2016-2020) Petteri Kaski (Aalto University)
- (2016-2020) Christian Komusiewicz (Philipps-Universität Marburg)
- (2016-2019) Frances Rosamond (University of Bergen)
- (2017-2020) Florian Sikora (LAMSADE, Université Paris Dauphine)
PACE is supported by the NWO Gravitation project ‘NETWORKS’.
Martin Josef Geiger keeps a nice list of various other computational challenges out there.