Combinatorial Optimization & Graph Algorithms

PhD theses within the group Algorithmic Discrete Mathematics

You can download the theses via ftp as Postscript file, optionally compressed by compress or gzip

Stefan Felsner (1992):

Interval Orders: Combinatorial Structure and Algorithms
[ps]  [ps.Z]  [ps.gz]

Jens Gustedt (1992):

Algorithmic Aspects of Ordered Structures
[ps]  [ps.Z]  [ps.gz]

Rudolf Müller (1993):

Bounds for linear VLSI layout problems
[ps]  [ps.Z]  [ps.gz]

Heike Ripphausen-Lipa (1994):

Efficient Algorithms for Disjoint Steiner Trees Packing Problems in Planar Graphs
[ps]  [ps.Z]  [ps.gz]

Karsten Weihe (1994):

Flow and Routing Problems in Planar Graphs
[ps]  [ps.Z]  [ps.gz]

Andreas Schulz (1996):

Polytopes and Scheduling
[ps]  [ps.Z]  [ps.gz]

Andreas Parra (1996):

Structural and Algorithmic Aspects of Chordal Graph Embeddings
[ps]  [ps.Z]  [ps.gz]

Markus Schäffter (1996):

Scheduling Jobs with Communication Delays: Complexity Results and Approximation Algorithms
[ps]  [ps.Z]  [ps.gz]

Ewa Malesinska (1997):

Graph-Theoretical Models for Frequency Assignment Problems
[ps]  [ps.Z]  [ps.gz]

Matthias Müller-Hannemann (1997):

Quadrilateral Mesh Generation in Computer-Aided Design
[ps]  [ps.Z]  [ps.gz]

Martin Skutella (1998):

Approximation and Randomization in Scheduling
[ps]  [ps.Z]  [ps.gz]

Ekkehard Köhler (1999):

Graphs without Asteroidal Triples
[ps]  [ps.Z]  [ps.gz]

Frederik Stork (2001):

Stochastic Resource-Constrained Project Scheduling
[ps]  [ps.Z]  [ps.gz]  [pdf]

Michael Naatz (2001):

Acyclic Orientations of Mixed Graphs
[ps]  [ps.Z]  [ps.gz]  [pdf]

Marc Uetz (2001):

Algorithms for Deterministic and Stochastic Scheduling
[ps]  [ps.Z]  [ps.gz]  [pdf]

Vanessa Kääb (2003):

Scheduling with AND/OR-Networks
[ps]  [ps.gz]  [pdf]