1. P. Alimonti, G. Ausiello, L. Giovaniello, M. Protasi, On the complexity of approximating weighted satisfiability problems, Rapporto Tecnico RAP 38.97, Dipartimento di Informatica e Sistemistica, Università degli Studi di Roma La Sapienza, 1997.
2. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999
3. Approximation hardness of short symmetric instances of max-3sat;Berman;Electronic Colloquium on Computational Complexity (ECCC),2003
4. On the complexity of scheduling incompatible jobs with unit-times;Bodlaender,1993
5. Determining a minimum spanning tree with disjunctive constraints;Darmann,2009