| 1995 |
|---|
| 7 | | Michael R. Fellows,
Jan Kratochvíl,
Martin Middendorf,
Frank Pfeiffer:
The Complexity of Induced Minors and Related Problems.
Algorithmica 13(3): 266-282 (1995) |
| 1994 |
|---|
| 6 | EE | Frank Pfeiffer:
A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs.
Discrete Applied Mathematics 51(1-2): 127-135 (1994) |
| 1993 |
|---|
| 5 | | Matthias Middendorf,
Frank Pfeiffer:
On the complexity of the disjoint paths problems.
Combinatorica 13(1): 97-107 (1993) |
| 4 | EE | Matthias Middendorf,
Frank Pfeiffer:
Weakly transitive orientations, Hasse diagrams and string graphs.
Discrete Mathematics 111(1-3): 393-400 (1993) |
| 1992 |
|---|
| 3 | EE | 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 | EE | Matthias Middendorf,
Frank Pfeiffer:
On the complexity of recognizing perfectly orderable graphs.
Discrete Mathematics 80(3): 327-333 (1990) |
