1

Improved Algorithms for Length-Minimal One-Sided Boundary Labeling

Benkert, Marc, Martin Nöllenburg

A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks

Daniel Wanger, Ulrich Pferschy, Petra Mutzel, Günther Raidl, P.Bachhiesl

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks

Daniel Wagner, Günther Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger

Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem

Andreas Chwatal, Günther Raidl, Olivia Dietzel

Determining Orbital Elements of Extrasolar Planets by Evolution Strategies

Andreas M. Chwatal, Günther Raidl

Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

Günther Raidl, Andreas Chwatal

Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps

Benkert, Marc, Martin Nöllenburg, Uno, Takeaki, Wolff, Alexander

Morphing Polygonal Lines: A Step Towards Continuous Generalization

Merrick, Damian, Martin Nöllenburg, Wolff, Alexander, Benkert, Marc

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

Markus Leitner, Bin Hu, Günther Raidl