7

Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem

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

G"unther Gruber

An Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problem

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

Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems

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

Sandor Alexander Kersting

Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem

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

Janosch Fauster

Verfahren zur Lösung eines Glasverschnittproblems

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

Jakob Puchinger

Ein Genetischer Algorithmus für das Generalized Assignment Problem

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

Conjunctive Normal Forms with Bounded Deficiency

9 2001, PhD thesis, University of Vienna.

Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz

1994, PhD thesis, Vienna University of Technology.