Daniel Rehfeldt and Thorsten Koch finished 3rd (Track A), 1st (Track B), and 2nd (Track C) in the 3rd Parameterized Algorithms and Computational Experiments Challenge (PACE 2018). It was the only code to participate in all three tracks.

Daniel was awarded during the 13th International Symposium on Parameterized and Exact Computation held on August 20-24 as part of ALGO 2018 in Helsinki, Finland.

The goal of the competition was to solve 100 particular instances of Steiner tree problems in graphs not known to the participants before in each of the tree independent tracks.

Track A: Exact solution with few terminals and high treewidth,
Track B: Exact solution with low treewidth and many terminals,
Track C: Heuristic solution with many terminals, high treewidth, and unsolved instances.

There were 33 complete submissions from teams out of 16 countries.

The SCIP-Jack code, available as part of the SCIP Optimization Suite (http://scip.zib.de) proved to be highly competitive, even though the tree decomposition given as extra information in Track B was not utilized.

Link: https://www.win.tue.nl/%7Ebjansen/talks/PACE2018.pdf