Preprints 1993

Preprint 245-1990
Hans L. Bodlaender and Rolf H. Möhring.
The pathwidth and treewidth of cographs.

Preprint 255-1990
Stefan Felsner.
Orthogonal Structures in Directed Graphs.

Preprint 247-1990
Michael Formann and Dorothea Wagner and Frank Wagner.
Routing through a Dense Channel with Minimum Total Wire Length.

Preprint 309-1991
Stefan Felsner.
Tolerance Graphs and Orders.

Preprint 307-1991
Dorothea Wagner and Frank Wagner.
Between Min Cut and Graph Bisection.

Preprint 343-1992
Edmund Ihler and Dorothea Wagner and Frank Wagner.
Modeling Hypergraphs by Graphs.

Preprint 319-1992
Klaus Jansen and Petra Scheffler.
Generalized coloring for tree-like graphs.

Preprint 318-1992
Dorothea Wagner.
Optimal Routing Through Dense Channels.

Preprint 349-1993
Stefan Felsner.
3-Interval Irreducible Partially Ordered Sets.

Preprint 368-1993
Stefan Felsner and Rudolf Müller and Lorenz Wernisch.
Optimal Algorithms for Trapezoid Graphs.

Preprint 348-1993
Stefan Felsner and Lorenz Wernisch.
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms.

Preprint 351-1993
Jens Gustedt.
Finiteness Theorems for Graphs and Posets Obtained by Compositions.

Preprint 350-1993
Jens Gustedt and Angelika Steger.
Testing Hereditary Properties Efficiently on Average.

Preprint 345-1993
Paul Molitor and Uwe Sparmann and Dorothea Wagner.
Two-Layer Wiring with Pin Preassignments.

Preprint 365-1993
Rolf H. Möhring.
Triangulating Graphs without Asteroidal Triples.