1. A note on two problems in connexion with graphs
2. An Appraisal of Some Shortest-Path Algorithms
3. and , “Flows in Networks,” Princeton University Press, Princeton, N. J., 1962.
4. “Integer Programming and Network Flows,” Addison-Wesley, Reeding, Mass., 1969.
5. “Network Flow, Transportation and Scheduling: Theory and Algorithms,” Academic Press, New York, 1969.