- Applying Lehman's Theorems to Packing Problems F.B. Shepherd
- Formulations for the Stable Set Polytope W.R. Pulleyblank F.B. Shepherd
- Multilateral Transport Games F.B. Shepherd, G.T. Wilfong
- Directed Network Design with Orientation Constraints Sanjeev Khanna y Joseph (Se) Naor z F. Bruce Shepherd x
- Perfect Graphs Edited by J.L. RAMIREZ ALFONSIN and B.A. REED
- Reserving Resilient Capacity in a Network G. Brightwell G. Oriolo
- A Scalable Algorithm for the Minimum Expected Cost Restorable Flow Problem
- [4] W. McCuaig, ``Intercyclic Digraphs,'' Graph Structure Theory, Contemporary Mathe matics 147, pp. 203246, 1993.
- The Stable Paths Problem and Interdomain Routing Timothy G. Griffin and F. Bruce Shepherd and Gordon Wilfong
- The VPN Conjecture is True F. B. Shepherd
- Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems
- NODECAPACITATED RING ROUTING Andr'as Frank \Lambda
- MATHEMATICS OF OPERATIONS RESEARCH Vol. 32, No. 3, August 2007, pp. 563578
- Single-Sink Multicommodity Flow with Side Constraints
- Degree-Constrained Network Flows Patrick Donovan
- Selective randomized load balancing and mesh networks with changing demands
- Design Tools for Transparent Optical Chandra Chekuri, Paul Claisse, Ren-Jean Essiambre,
- [6] A. Schrijver, Disjoint homotopic paths and trees in a planar graph: Description of the method, manuscript (1988).
- [16] N.C. Wormald, Classifying kconnected cubic graphs, Lecture Notes in Mathematics; New York, Springer Verlag, 748, (1979), 199206.
- Island Hopping and Path Colouring with applications to WDM Network Design
- Route Oscillations in IBGP with Route Reflection Anindya Basu ChihHao Luke Ong April Rasala
- A Cycle Augmentation Algorithm for Minimum Cost Multicommodity Flows on a Ring
