Article

Euler, Reinhardt and Jünger, Michael and Reinelt, Gerhard (1987) Generalizations of Cliques, Odd Cycles and Anticycles and their relation to Independence System Polyhedra.
Published in: Mathematics of Operations Research Vol. 12 (3). pp. 451-462. ISSN 0364-765X

Faßbender, Bert (1989) Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen.
Published in: Mathematische Nachrichten Vol. 142 (1). pp. 287-296.

Faßbender, Bert (1989) On Longest Cycles and Strongly Linking Vertex Sets.
Published in: Journal of Graph Theory Vol. 13 (6). pp. 697-702.

Faßbender, Bert (1991) On a generalization of a theorem of Nash-Williams.
Published in: Journal of combinatorial theory : Series B Vol. 52 (1). pp. 42-44.

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1985) On the acyclic Subgraph Polytope.
Published in: Mathematical Programming Vol. 33 (1). pp. 28-42. ISSN 0025-5610

Hochstättler, Winfried and Jackson, Bill (1998) Large Circuits in Binary Matroids of Large Cogirth: II.
Published in: Journal of Combinatorial Theory B Vol. 74 (1). pp. 53-63.

Hochstättler, Winfried and Nesetril, Jaroslav (2000) A Note on MaxFlow-MinCut and Homomorphic Equivalence in Matroids.
Published in: Journal of algebraic combinatorics : an international journal Vol. 12 (3). pp. 295-300.

Hofmeister, Michael (1993) Non-Equivalent Cocycles of Graphs over Finite Fields.
Published in: Ars combinatoria : a Canadian journal of combinatorics Vol. 36. pp. 119-127.

Lätsch, Martin and Peis, Britta (2008) On a relation between the domination number and a strongly connected bidirection of an undirected graph.
Published in: Discrete Applied Mathematics Vol. 156 (17). pp. 3194-3202.

Middendorf, Matthias and Pfeiffer, Frank (1993) On the Complexity of the Disjoint Path Problem.
Published in: Combinatorica Vol. 13 (1). pp. 97-107.

Collection Item

Bachem, Achim and Hamacher, Anja and Moll, Christoph and Raspel, Guido (1997) Optimale Linienführung und Routenplanung in Verkehrssystemen.
Published in: Mathematik : Schlüsseltechnologie für die Zukunft ; Verbundprojekte zwischen Universität und Industrie. Springer 1997, pp. 626-636.

Proceedings article

Korach, Ephraim and Nguyen, Thành and Peis, Britta (2006) Subgraph characterization of Red/Blue-split graphs and König-Egerváry graphs.
Published In: SODA : Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Miami, FL., January 22 - 24, 2006 ACM 2006, pp. 842-850.

Middendorf, Matthias and Pfeiffer, Frank (1990) On the complexity of the disjoint paths problem (Extended abstract).
Published In: Polyhedral combinatorics : proceedings of a DIMACS Workshop ; June 12 - 16, 1989, DIMACS series in discrete mathematics and theoretical computer science. 1 1990, pp. 171-178.

Middendorf, Matthias and Pfeiffer, Frank (1990) The Paths-Selection-Problem.
Published In: Polyhedral combinatorics : proceedings of a DIMACS Workshop ; June 12 - 16, 1989, DIMACS series in discrete mathematics and theoretical computer science. 1 1990, pp. 179-187.

Paper

Blasum, Ulrich and Hochstättler, Winfried and Oertel, Peter (1999) Steiner-Diagrams.
Technical Report , 8 p.

Heinrichs, Udo and Moll, Christoph (1997) On the scheduling of one-dimensional transport systems.
Technical Report , 18 p.

Hochstättler, Winfried and Nesetril, Jaroslav (1997) Menger's Theorem as Morphism Duality.
Technical Report , 5 p.

Hochstättler, Winfried and Oertel, Peter (2000) The 5-Star-Hub-Problem is NP-complete.
Technical Report , 4 p.

Schwikowski, B. and Speckenmeyer, Ewald (1997) On computing all minimal solutions for feedback problems.
Technical Report , 10 p.

Thesis

Moll, Christoph (1995) Das inverse Kürzeste-Wege-Problem. PhD thesis.

Oertel, Peter (2000) Routing with Reloads. PhD thesis.