1

Maximizing Ink in Partial Edge Drawings of k-plane Graphs

Hummel, Matthias, Klute, Fabian, Nickel, Soeren, Martin Nöllenburg

Mixed Linear Layouts: Complexity, Heuristics, and Experiments

De Col, Philipp, Klute, Fabian, Martin Nöllenburg

Motif Counting in Preferential Attachment Graphs

Jan Niclas Dreier

Proof Complexity of Fragments of Long-Distance Q-resolution

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider

Refined Complexity of PCA with Outliers

Kirill Simonov and Fedor v. Fomin and Petr A. Golovach and Fahad Panolan

SAT-Encodings for Treecut Width and Treedepth

Robert Ganian, Neha Lodha, Stefan Szeider

Solving integer quadratic programming via explicit and structural restrictions

Eduard Eiben, Robert Ganian, Dusan Knop and Sebastian Ordyniak

Strategies for Iteratively Refining Layered Graph Models

Martin Riedler, Mario Ruthmair, Günther Raidl

The Complexity of Packing Edge-Disjoint Paths

Jan Niclas Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang

The Parameterized Complexity of Cascading Portfolio Scheduling

Eduard Eiben, Robert Ganian, Stefan Szeider