1. G. Ausiello, A. D'Atri, M. Protasi.On the structure of combinatorial problems and structure preserving reductions. Proc. 4th ICALP, (1977), 45–60.
2. G. Ausiello, A. D'Atri, M. Protasi.Structure preserving reductions among convex optimization problems. J. Comput. System Sc. (to appear).
3. M. Garey, D. Johnson.Computers and intractability: a guide to the theory of NP-completeness (1979). W. H. Freeman and Company, S. Francisco.
4. R. Kannan, B. Korte.Approximative combinatorial algorithms. T. Rep. 78107-OR, University of Bonn, (1978).
5. R. M. Karp.Reducibility among combinatorial problems.In:Complexity of computer computations. (1972). R. E. Miller and J. W. Thatcher Eds. Plenum Press, New York.