1. DIMACS Ser. Discrete Math. Theoret. Comput. Sci.;D. J. Aldous,1998
2. N. Alon, W. Fernandez de la Vega, R. Kannan and M. Karpinski: Random sampling and approximation of MAX-CSPs, J. Comput. System Sci. 67 (2003), 212–243.
3. N. Alon and A. Naor: Approximating the Cut-Norm via Grothen-dieck’s Inequality, preprint: http://research.microsoft.com/research/theory/naor/homepage%20files/cutnorm.pdf
4. N. Alon and A. Shapira, Every monotone graph property is testable, Proc. of the 37th ACM STOC, Baltimore, ACM Press (2005), to appear: http://www.math.tau.ac.il/~nogaa/PDFS/MonotoneSTOC.pdf
5. E. Babson and D. Kozlov: Complexes of graph homomorphisms, arX-ive: http://lanl.arxiv.org/abs/math.CO/0310056