1. On the entropy values of hereditary classes of graphs
2. , , , and , Efficient testing of large graphs, Proc 40th IEEE Symp Foundations of Computer Science, 1999, pp. 656–666.
3. Also: Combinatorica 20 (2000), 451.
4. , and , A characterization of the (natural) graph properties testable with one-sided error, Proc 46th IEEE Symp Foundations of Computer Science, 2005, pp. 429–438.
5. , , and , Additive approximation for edge-deletion problems, Proc 46th IEEE Symp Foundations of Computer Science, 2005, pp. 419–428.