1

Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case

Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther Raidl

Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search

Faster Existential FO Model Checking on Posets

Jakub Gajarský and Petr Hlinený and Jan Obdrzálek and Sebastian Ordyniak

Finite Integer Index of Pathwidth and Treewidth

Jakub Gajarský and Jan Obdrzálek and Sebastian Ordyniak and Felix Reidl and Peter Rossmanith and Fernando Sanchez Villaamil and Somnath Sikdar

Fixed-Parameter Tractable Reductions to SAT

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

Klemz, Boris, Mchedlidze, Tamara, Martin Nöllenburg

On the Kernelization Complexity of String Problems

Manu Basavaraju and Fahad Panolan and Ashutosh Rai and M. S. Ramanujan and Saket Saurabh

Parameterized Algorithms to Preserve Connectivity

Manu Basavaraju and Fedor v. Fomin and Petr A. Golovach and Pranabendu Misra and M. S. Ramanujan and Saket Saurabh

Parameterized Approximations via d-Skew-Symmetric Multicut

Sudeshna Kolay and Pranabendu Misra and M. S. Ramanujan and Saket Saurabh

PIGRA -- A Tool for Pixelated Graph Representations

Bläsius, Thomas, Klute, Fabian, Niedermann, Benjamin, Martin Nöllenburg