Technical Reports 1988 of the group Combinatorial Optimization & Graph Algorithms

Technical reports 1988

Technical Report 187-1988: Norbert Korte and Rolf H. Möhring

An Incremental Linear-Time Algorithm to Recognize Interval Graphs
Technical Report 188-1988: M. Bartusch, Rolf H. Möhring, and Franz J. Radermacher

Scheduling Project Networks with Resource Constraints and Time Windows
Technical Report 192-1988: M. Bartusch, Rolf H. Möhring, and Franz J. Radermacher

M-Machine Unit Time Scheduling: A Report on Ongoing Research
Technical Report 195-1988: Michel Habib, Rolf H. Möhring, and George Steiner

Computing The Bump Number of Ordered Sets is Easy
Technical Report 205-1988: Rolf H. Möhring and Franz J. Radermacher

The Order-Theoretic Approach to Scheduling: The Deterministic Case
Technical Report 207-1988: Michel Habib, David Kelly, and Rolf H. Möhring

Interval Dimension is a Comparability Invariant.