1. M. Andrews, J. Chuzhoy, S. Khanna, L. Zhang, Hardness of the undirected edge-disjoint paths problem with congestion, in Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), Pittsburgh (2005), pp. 226–244
2. S. Arora, E. Chlamtac, M. Charikar, New approximation guarantee for chromatic number, in Proceedings of the 38th STOC, Seattle (2006) pp. 215–224
3. S. Arora, S. Rao, U. Vazirani, Expanders, geometric embeddings and graph partitioning. J. ACM 56(2), 1–37 (2009). Announced at STOC’04
4. B. Berger, J. Rompel, A better performance guarantee for approximate graph coloring. Algorithmica, 5(3), 459–466 (1990)
5. A. Blum, New approximation algorithms for graph coloring. J. ACM 41(3), 470–516 (1994). Announced at STOC’89 and FOCS’90