PACE 2019 winners announced
Last week the prize-giving ceremony of the 2019 version of PACE, the "Parameterized Algorithms
& Computational Experiments Challenge", took place in München. Bart Jansen was one of the
organisers and the event was sponsored by Networks.
This year the award ceremony was part of the "ALGO" week, an
annual event that brings together a number of algorithmic
conferences. PACE was a big success this year; the competition
had 18 teams and 33 participants from 10 different countries.
New this year was that, in addition to the award ceremony, there
was also a poster session at the ALGO week in which the
participants presented their work to the other attendees.
The challenge problems
The first track featured the MinVertexCover problem (track 1a), and the other two tracks were dedicated to Hypertree Decompositions (Tracks 2a and 2b).
The winners of PACE 2019 are:
| Track 1a (Vertex Cover/Exact) | |
| 1st place: | Demian Hespe and Sebastian Lamm (Karlsruhe University of Technology), Christian Schulz (University of Vienna) and Darren Strash (Hamilton College) |
| 2nd place: | Patrick Prosser and James Trimble (University of Glasgow) |
| 3rd place: | Sándor Szabó (University of Pecs) and Bogdán Zaválnij (Hungarian Academy of Sciences) |
| Track 2a (Hypertree Width/Exact) | |
| 1st place: | André Schidler and Stefan Szeider (TU Wien) |
| 2nd place: | Davide Mario Longo (TU Wien) |
| 3rd place: | Patrick Prosser and James Trimble (University of Glasgow) |
| Track 2b (Hypertree Width/Heuristic) | |
| 1st place: | Patrick Prosser and James Trimble (University of Glasgow) |
| 2nd place: | Davide Mario Longo (TU Wien) |
| 3rd place: | André Schidler and Stefan Szeider (TU Wien) |
Chairs and Winners of Track 2a: J.K. Fichte (left), M. Hecher, S. Szeider (Team asc), B.M.P. Jansen, F. Rosamond