Institut[e] f(o|ü)r Informati(cs|k), [Universität] Osnabrück [University]
Here, we provide experimental results for download referenced in the paper Stronger ILPs for the Graph Genus Problem by M. Chimani and T. Wiedera to appear in Proc. of ESA 2019.
We list the running time of each algorithmic variant in microseconds as well as the best primal and dual bound for each instance. If an algorithm exceeded its memory or time limit we omit the respective entry.