Polyhedral Approaches to Network Survivability. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (Reliability Of Computer And Communication Networks, 1989)

On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. - Norbert Ascheuer; Laureano F. Escudero; Martin Grötschel; Mechthild Stoer (IPCO, 1990)

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (Oper. Res., 1992)

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (SIAM J. Optim., 1992)

A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing). - Norbert Ascheuer; Laureano F. Escudero; Martin Grötschel; Mechthild Stoer (SIAM J. Optim., 1993)

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (Oper. Res., 1995)

A simple min-cut algorithm. - Mechthild Stoer; Frank Wagner 001 (J. ACM, 1997)

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. - Geir Dahl; Mechthild Stoer (INFORMS J. Comput., 1998)

Routing Through Virtual Paths in Layered Telecommunication Networks. - Geir Dahl; Alexander Martin 001; Mechthild Stoer (Oper. Res., 1999)