direkt zum Inhalt springen
direkt zum Hauptnavigationsmenü
Sie sind hier
Suche
Institut für MathematikFG Kombinatorische Optimierung und Graphenalgorithmen
Sie sind auf Seite:1 | 2
Preprint 285-1991 Stefan Felsner and Michel Habib and Rolf H. Möhring. On the Interplay between Interval Dimension and Dimension.
Preprint 336-1992 Michel Habib and Rolf H. Möhring. Treewidth of cocomparability graphs and a new order-theoretic parameter.
Preprint 333-1992 Dirk Möller and Rudolf Müller. A Concept for the Representation of Data and Algorithms.
Preprint 317-1992 Majid Sarrafzadeh and Dorothea Wagner and Frank Wagner and Karsten Weihe. Wiring Knock-Knee Layouts: A Global Approach.
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 386-1994 Annelie von Arnim and Andreas S. Schulz. Facets of the Generalized Permutahedron of a Poset.
Preprint 375-1994 Christophe Fiorio and Jens Gustedt. Two Linear Time Union-Find Strategies for Image Processing.
Preprint 394-1994 Jens Gustedt. The General Two-Path Problem in time $O(m łog n)$, extended abstract.
Preprint 377-1994 Möhring, Rolf H. and Müller-Hannemann, Matthias and Weihe, Karsten. Using Network Flows for Surface Modeling.
Preprint 401-1994 Rudolf Müller and Andreas S.\ Schulz. The Interval Order Polytope of a Digraph.
Preprint 376-1994 Valeska Naumann. Measuring the Distance to Series-Parallelity by Path Expressions.
Preprint 392-1994 Andreas Parra. Triangulating Multitolerance Graphs.
Preprint 407-1994 Andreas Parra and Petra Scheffler. How to Use the Minimal Separators of a Graph for Its Chordal Triangulation.
Preprint 393-1994 Maurice Queyranne. A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions.