1. Set Partitioning: A survey
2. and , “All the Facets of 0–1 Programming Polytopes with Positive Coefficients,” MSRR No. 374, Carnegie-Mellon University, October 1975.
3. “On Certain Polytopes Associated with Graphs,” J. of Combinatorial Theory, B, 18, 1975, pp. 138–154.
4. Covers and packings in a family of sets
5. Maximum matching and a polyhedron with 0,1-vertices