1. Albert, R., & Barabási, A.-L. (2002). Statistical mechanics of complex networks. Review of Modern Physics, 74, 47–97.
2. Alon, N., Fischer, E., Newman, I., & Shapira, A. (2008). A combinatorial characterization of the testable graph properties: It’s all about regularity. SIAM Journal on Computing, 37(6), 1703–1727.
3. Alon, N., Seymour, P., & Thomas, R. (1990). Separator theorem for graphs with an excluded minor and its applications. Proceedings STOC, 1990, 293–299.
4. Alon, N., & Shapira, A. (2005). Every monotone graph property is testable. In Proceedings of STOC 2005 (pp. 128–138). (Journal version: SIAM J. Comput., Vol. 38, No. 6, pp. 1703–1727, (2008)).
5. Alon, N., & Shapira, A. (2005). A characterization of the (natural) graph properties testable with one-sided error. In Proceedings of FOCS 2005 (pp. 429–438) (Journal version: SIAM J. Comput., Vol. 37, No. 6, pp. 1703–1727, (2008)).