#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1990

2004

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Matthias Middendorf, Frank Pfeiffer
- Discrete Mathematics
- 1992

- Matthias Middendorf, Frank Pfeiffer
- Combinatorica
- 1993

- Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
- Algorithmica
- 1995

The computational complexity of a number of problems concerning induced structures in graphs is studied, and compared with the complexity of corresponding problems concerning non-induced structures. The effect on these problems of restricting the input to planar graphs is also considered. The principal results include: (1) Induced Maximum Matching and… (More)

- Matthias Middendorf, Frank Pfeiffer
- Discrete Mathematics
- 1990

- Matthias Middendorf, Frank Pfeiffer
- Discrete Mathematics
- 1993

Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, Discrete Mathematics 111 (1993) 393-400. We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden… (More)

- Matthias Middendorf, Carsten Peust, Johannes Schacht
- Reading and Learning
- 2004

A symmetric matroid is a matroid deened on the edge-set of some countably innnite complete graph K in a way that ranks of nite sub-graphs of K are invariant under isomorphism. Thus a symmetric ma-troid M induces on any nite graph G a uniquely determined matroid M(G). We study connectivity properties of circuits and generalized trees of symmetric matroids.… (More)

- Matthias Middendorf, Frank Pfeiffer
- Polyhedral Combinatorics
- 1990

- Matthias Middendorf, Frank Pfeiffer
- Polyhedral Combinatorics
- 1990

- Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
- Graph Structure Theory
- 1991

- ‹
- 1
- ›