1. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
2. and , On finding a maximum independent stable set of a graph. In Proc. of Fourth Annual Princeton Conference on Information Sciences and Systems. Princeton, NJ, 1970.
3. and , Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979).
4. , , and , The complexity of coloring circular arcs and chords. Technical Report, Bell Telephone Laboratories, Murray Hills, NJ, 1979.