Technical Reports 1993 of the group Combinatorial Optimization & Graph Algorithms

Technical reports 1993

Technical Report 345-1993: Paul Molitor, Uwe Sparmann, and Dorothea Wagner

Two-Layer Wiring with Pin Preassignments
Technical Report 348-1993: Stefan Felsner and Lorenz Wernisch

Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
Technical Report 349-1993: Stefan Felsner

3-Interval Irreducible Partially Ordered Sets
Technical Report 350-1993: Jens Gustedt and Angelika Steger

Testing Hereditary Properties Efficiently on Average
Technical Report 351-1993: Jens Gustedt

Finiteness Theorems for Graphs and Posets Obtained by Compositions
Technical Report 354-1993: Dorothea Wagner and Karsten Weihe

CRoP: A Library of Algorithms for the Channel Routing Problem
Technical Report 357-1993: Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs
Technical Report 358-1993: Karsten Weihe

Non-Crossing Path Packings in Planar Graphs with Applications
Technical Report 359-1993: Karsten Weihe

Multicommodity Flows in Even, Planar Networks
Technical Report 365-1993: Rolf H. Möhring

Triangulating Graphs without Asteroidal Triples
Technical Report 367-1993: Dorothea Wagner

Simple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs
Technical Report 368-1993: Stefan Felsner, Rudolf Müller, and Lorenz Wernisch

Optimal Algorithms for Trapezoid Graphs