1. Two greedy heuristics for the weighted perfect matching problem. In Proc. Ninth Southeastern Conf. on Combinatorics, Graph Theory, and Computing, (1978) 65–76.
2. Asymptotic Methods in Analysis. North-Holland, Amsterdam (1961). Republished by Dover, New York (1981).
3. An Introduction to Probability Theory and Its Applications. Wiley, New York (1968), Vol. I.
4. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
5. , and , Linear-time heuristics for the minimum-weight perfect matching on a plane with an application to the plotter algorithm. Unpublished (1980).