1

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning

Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran

Label Placement in Road Maps

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

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set

Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem

Alan Tus, Andrea Rendl, Günther Raidl

Metric Dimension of Bounded Width Graphs

Rémy Belmonte and Fedor v. Fomin and Petr A. Golovach and M. S. Ramanujan

On Compiling CNFs into Structured Deterministic DNNFs

Simone Bova and Florent Capelli and Stefan Mengel and Friedrich Slivovsky

On Compiling Structured CNFs to OBDDs

Simone Bova and Friedrich Slivovsky

On Minimizing Crossings in Storyline Visualizations

Kostitsyna, Irina, Martin Nöllenburg, Polishchuk, Valentin, Schulz, André, Strash, Darren

On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics

Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther Raidl