1

Strong Backdoors to Bounded Treewidth SAT

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

The Parameterized Complexity of Constraint Satisfaction and Reasoning

Trajectory-Based Dynamic Map Labeling

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

Upper and Lower Bounds for Weak Backdoor Set Detection

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings

Biedl, Therese, Bläsius, Thomas, Niedermann, Benjamin, Martin Nöllenburg, Prutkin, Roman, Rutter, Ignaz

Using Optimized Virtual Network Embedding for Network Dimensioning

Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther Raidl

Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor

Athenstädt, Jan Christoph, Görke, Robert, Krug, Marcus, Martin Nöllenburg

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Mario Ruthmair, Günther Raidl

A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Martin Berlakovich, Mario Ruthmair, Günther Raidl