1. and , “Finding a Minimum Node Cover in an Arbitrary Graph.” Management Science Research Report, GSIA No 325, Carnegie-Mellon University (November 1973).
2. Set Partitioning: A survey
3. and , “Graph Substitution and Set Packing Polytopes,” Management Science Research Report, GSIA No. 384, Carnegie-Mellon University (January 1976), to appear, Networks.
4. and , “Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes,” Management Science Research Report No. 385, Carnegie-Mellon University (February 1976); to appear, Mathematics of Operations Research.
5. Graphs and Hypergraphs (North-Holland, 1973).