1

Local Backbones

Ronald De Haan, Iyad A. Kanj, Stefan Szeider

Model Counting for Formulas of Bounded Clique-Width

On the Subexponential Time Complexity of CSP

Iyad Kanj, Stefan Szeider

On The Usability of Lombardi Graph Drawings

Purchase, Helen C., Hamer, John, Martin Nöllenburg, Kobourov, Stephen G.

Parameterized Complexity and Kernel Bounds for Hard Planning Problems

Christer Bäckström, Peter Jonsson and Sebastian Ordyniak, Stefan Szeider

Parameterized Complexity Results for Plan Reuse

Ronald De Haan, Anna Roubickova, Stefan Szeider

Planar Lombardi Drawings of Outerpaths

Löffler, Maarten, Martin Nöllenburg

Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive

Benjamin Biesinger, Christian Schauer, Bin Hu, Günther Raidl

Revisiting Space in Proof Complexity: Treewidth and Pathwidth

Moritz Müller, Stefan Szeider

Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent

Johannes Inführ, Günther Raidl