7

Reconstructing Borders of Manually Torn Paper Scheets Using Integer Linear Programming

January 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Prandtstetter

Peter Schüller

Map-Matching und Wegsuche in einem geografischen Informationssystem

December 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl

Andreas Braumann

Algorithmic Approaches to the String Barcoding Problem

October 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl

Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem

October 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl

Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction

May 2007, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and F.~Eisenhaber

Nedim Mujezinovic

Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks

March 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and D.~Wagner

Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters

December 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl, R. Weiskircher, and M. Percan

A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem

October 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and J.~Puchinger

Sandro Pirkwieser

Solving Two Generalized Network Design Problems with Exact and Heuristic Methods

May 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu

An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem

January 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Gruber

Boris Kopinitsch