1. On Finding Lowest Common Ancestors in Trees
2. “An Algorithm to Construct a Minimum Directed Spanning Tree in a Directed Network”, Developments in Operations Research, Gordon and Breach, New York, 1971, pp. 29–44.
3. and , “The K Best Spanning Arborescences of a Network”, to be published.
4. Finding Minimum Spanning Trees