Institut[e] f(o|ü)r Informati(cs|k), [Universität] Osnabrück [University]
Here you can find experimental results from two of our papers that deal with exactly computing maximum planar subgraphs. For each instance, we provide the optimal solution (if solved) and the runtime for each of the algorithmic variants. Empty cells in the latter columns indicate that the respective algorithm did not terminate in time. The set of random regular graphs that we generated is also available for download.