1. , and , The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974).
2. A linear-time algorithm for finding a minimum-weight spanning tree in graphs in which all cycles pass through a single vertex. Unpublished.
3. and , A computational study comparing the efficiency of various list structures in matching algorithm. Unpublished.
4. A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles
5. A primal algorithm for optimum matching