1. M. Ajtai. Recursive construction for 3-regular expanders. In 28th Annual Symposium on Foundations of Computer Science, pages 295–304, 1987.
2. N. Alon. Eigenvalues and expanders. Comb, 6(2):83–96, 1986.
3. S. Arora. The approximability of NP-hard problems. In 28th Annual Symposium on Theory of Computing, pages 337–348, 1998.
4. S. Arora. Porynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. JACM, 45(5):753–782, Sept. 1998.
5. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of graph problems. JCSS, 2000, to appear. Preliminary version in STOC’95.