Technical Reports 1991 of the group Combinatorial Optimization & Graph Algorithms

Technical reports 1991

Technical Report 275-1991: Stefan Felsner

Bounds for the Jump Number of Partially Ordered Sets
Technical Report 276-1991: Christoph Meinel and Stephan Waack

Separating complexitiy classes related to bounded alternating omega-branching programs
Technical Report 279-1991: Dorothea Wagner

A New Approach to Knock-Knee Channel Routing
Technical Report 285-1991: Stefan Felsner, Michel Habib, and Rolf H. Möhring

On the Interplay between Interval Dimension and Dimension
Technical Report 290-1991: Jens Gustedt

Well Quasi Ordering Finite Posets and Formal Languages
Technical Report 291-1991: Stefan Felsner, Jens Gustedt, Michel Morvan, and Jean-Xavier Rampon

Constructing Colorings for Diagrams
Technical Report 295-1991: Stefan Felsner and Dorothea Wagner

On the Complexity of Partial Order Properties
Technical Report 307-1991: Dorothea Wagner and Frank Wagner

Between Min Cut and Graph Bisection
Technical Report 308-1991: Stefan Felsner and William T. Trotter

Colorings of Diagrams of Interval Orders and alpha-Sequences of Sets
Technical Report 309-1991: Stefan Felsner

Tolerance Graphs and Orders