1. and , Flows in Networks, Princeton University Press, 1962.
2. Linear Programming and Extensions, Princeton University Press, 1963.
3. An Algorithm for Vertex-pair Connectivity
4. A new derivation of Frisch's algorithm for calculating vertex-pair connectivity
5. “Edge-Disjoint Routes and Blocking Routes Problems,” Department of Statistics and Operations Research, University of Pennsylvania, November 1969.