1

On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem

Christian Schauer, Günther Raidl

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids

Fahad Panolan and M. S. Ramanujan and Saket Saurabh

On the Readability of Boundary Labeling

Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg

Operating Power Grids with Few Flow Control Buses

Leibfried, Thomas, Mchedlidze, Tamara, Meyer-Hübner, Nico, Martin Nöllenburg, Rutter, Ignaz, Sanders, Peter, Wagner, Dorothea, Wegner, Franziska

Parameterized Algorithms for Parity Games

Jakub Gajarský and Michael Lampis and Kazuhisa Makino and Valia Mitsou and Sebastian Ordyniak

Recognizing Weighted Disk Contact Graphs

Klemz, Boris, Martin Nöllenburg, Prutkin, Roman

Reconfiguration on Sparse Graphs

Daniel Lokshtanov and Amer E. Mouawad and Fahad Panolan and M. S. Ramanujan and Saket Saurabh

Solving d-SAT via Backdoors to Small Treewidth

Fedor v. Fomin and Daniel Lokshtanov and Neeldhara Misra and M. S. Ramanujan and Saket Saurabh

Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

Frederico Dusberger, Günther Raidl

Towards Realistic Flow Control in Power Grid Operation

Mchedlidze, Tamara, Martin Nöllenburg, Rutter, Ignaz, Wagner, Dorothea, Wegner, Franziska