Preprint 181-1987
Rolf H. Möhring.
Computationally Tractable Classes of Ordered Sets.

Preprint 187-1988
Norbert Korte and Rolf H. Möhring.
An Incremental Linear-Time Algorithm to Recognize Interval Graphs.

Preprint 205-1988
Rolf H. Möhring and Franz J. Radermacher.
The Order-Theoretic Approach to Scheduling: The Deterministic Case.

Preprint 224-1989
Martin Bartusch and Rolf H. Möhring and Franz J. Radermacher.
Design Aspects of an Advanced Model-Oriented DSS for Scheduling Problems in Civil Engineering.

Preprint 220-1989
Stefan Felsner.
A 3/2-Approximation Algorithm for the Jump Number of Interval Orders.

Preprint 221-1989
Jens Gustedt.
On the Pathwidth of Chordal Graphs.

Preprint 218-1989
Ruth Kuchem and Dorothea Wagner and Frank Wagner.
Area-Optimal Three-Layer Channel Routing.

Preprint 223-1989
Rolf H. Möhring.
Graph Problems related to Gate Matrix Layout and PLA Folding.

Preprint 210-1989
Rolf H. Möhring and Franz J. Radermacher.
The Order-Theoretic Approach to Scheduling: The Stochastic Case.

Preprint 225-1989
Rudolf Müller and Dorothea Wagner.
α-Vertex-Separation is $N\!\!P$-hard even for 3-regular Graphs.

Preprint 230-1989
Wictor Piotrowski and Maciej M. Syslo.
A Minmax Facility Location Problem.

Preprint 235-1989
Andrzej Proskurowski and Maciej M. Sysło.
Efficient Computations in Tree-Like Graphs.

Preprint 227-1989
Maciej M. Syslo.
Bounds to the Page Number of Partially Ordered Sets.

Preprint 228-1989
Dorothea Wagner.
Decomposition of Partial Orders.

Preprint 209-1989
Dorothea Wagner and Frank Wagner.
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.