1

Connecting Two Trees with Optimal Routing Cost

Kao, Mong-Jen, Katz, Bastian, Krug, Marcus, Lee, D. T., Martin Nöllenburg, Rutter, Ignaz, Wagner, Dorothea

Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints

Johannes Inführ, Günther Raidl

Kernels for Global Constraints

Limits of Preprocessing

New Results on the Complexity of the Max- and Min-Rep Problems

On d-regular Schematization of Embedded Paths

Gemsa, Andreas, Martin Nöllenburg, Pajor, Thomas, Rutter, Ignaz

Paths, Flowers and Vertex Cover

Venkatesh Raman and M. S. Ramanujan and Saket Saurabh

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Sliding Labels for Dynamic Point Labeling

Gemsa, Andreas, Martin Nöllenburg, Rutter, Ignaz

Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments

Sandro Pirkwieser, Günther Raidl, Jens Gottlieb