1

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

Jakob Walla, Mario Ruthmair, Günther Raidl

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

Martin~Gruber, Günther Raidl

The Parameterized Complexity of Oriented Colouring

(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Günther Raidl, Martin Gruber

A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows

Sandro Pirkwieser, Günther Raidl

Algorithms for Multi-Criteria One-Sided Boundary Labeling

Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Martin Nöllenburg

Automata approach to graphs of bounded rank-width

Robert Ganian, Petr Hlinený

Marko Samer, Stefan Szeider

Combining Forces to Reconstruct Strip Shredded Text Documents

Matthias Prandtstetter, Günther Raidl