1. B. Aspvall, M.F. Plass and R.E. Tarjan, “A linear-time algorithm for testing the truth of certain quantified Boolean formulas”,Information Processing Letters 8 (1979) 121–123.
2. M.L. Balinski, “Integer programming: Methods, uses, computation”, in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the decision sciences, Part I (American Mathematical Society, Providence, 1968), pp 179–256.
3. M.L. Balinski, “Notes on a constructive approach to linear programming”, in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the decision sciences, Part I (American Mathematical Society, Providence, 1968) pp. 38–64.
4. S. Cook, “The complexity of theorem proving procedures”,Proceedings of the Third Symposium of the Association of Computing Machinery on the Theory of Computing (1971) 151–158.
5. M.L. Fischer, G.L. Nemhauser and L.A. Wolsey, “An analysis of approximations for maximizing submodular set functions—I”,Mathematical Programming 14 (1978) 265–294.