 | 2004 |
|---|
| 6 |       | Matthias Middendorf,
Carsten Peust,
Johannes Schacht:
A Component-Based Framework for Recognition Systems.
Reading and Learning 2004: 153-165 |
| 1993 |
|---|
| 5 |  | Matthias Middendorf,
Frank Pfeiffer:
On the complexity of the disjoint paths problems.
Combinatorica 13(1): 97-107 (1993) |
| 4 | | Matthias Middendorf,
Frank Pfeiffer:
Weakly transitive orientations, Hasse diagrams and string graphs.
Discrete Mathematics 111(1-3): 393-400 (1993) |
| 1992 |
|---|
| 3 | | Matthias Middendorf,
Frank Pfeiffer:
The max clique problem in classes of string-graphs.
Discrete Mathematics 108(1-3): 365-372 (1992) |
| 1991 |
|---|
| 2 | | Michael R. Fellows,
Jan Kratochvíl,
Matthias Middendorf,
Frank Pfeiffer:
Induced minors and related problems.
Graph Structure Theory 1991: 179-182 |
| 1990 |
|---|
| 1 | | Matthias Middendorf,
Frank Pfeiffer:
On the complexity of recognizing perfectly orderable graphs.
Discrete Mathematics 80(3): 327-333 (1990) |
