1. A. Aiello, E. Burattini, M. Furnari, A. Massarotti, F. Ventriglia, Computational complexity: the problem of approximation, in: Colloquia Mathematica Societatis János Bolyai (Ed.) Algebra, Combinatorics, and Logic in Computer Science, Vol. I, North-Holland, New York, 1986, pp. 51–62.
2. On the structure of combinatorial problems and structure preserving reductions;Ausiello,1977
3. Structure preserving reductions among convex optimization problems;Ausiello;J. Comput. System Sci.,1980
4. Towards a unified approach for the classification of NP-complete optimization problems;Ausiello;Theoret. Comput. Sci.,1980
5. Complexity and Approximation Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999