1. N. Alon: Testing subgraphs in large graphs, in: Proc. 42nd IEEE FOCS, IEEE (2001), pp. 434–441; also: Random Structures and Algorithms 21 (2002), 359–370.
2. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, in: Proc. of 40th FOCS, New York, NY, IEEE (1999), pp. 656–666; also: Combinatorica 20(3) (2000), 451–476.
3. N. Alon, E. Fischer, I. Newman and A. Shapira: A combinatorial characterization of the testable graph properties: it’s all about regularity; in: Proc. of STOC 2006, pp. 251–260; also: SIAM Journal on Computing, to appear.
4. N. Alon and A. Shapira: Every monotone graph property is testable, in: Proc. of STOC 2005, pp. 128–137; also: SIAM Journal on Computing, to appear.
5. N. Alon and A. Shapira: A characterization of the (natural) graph properties testable with one-sided error, SIAM J. on Computing 37(6) (2008), 1703–1727.