1. F. Alizadeh, “A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs,” In: ACM-SIAM Symposium on Discrete Algorithms, Vol. 2, 188–194 (1991).
2. N. Alon and N. Kahale, “Approximating the independence number via the theta-function,” Math. Program., 80, No. 3, 253–264 (1988).
3. S. Benson and Y. Ye, “Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation,” In: Applications and Algorithms of complementarity, Eds. M. Ferris and J. Pang , Kluwer Academic Publishers, (2000), pp. 1–18.
4. J. V. Burke, A. S. Lewis, and M. L. Overton, “Two numerical methods for optimizing matrix stability,” Linear Algebra Appl., 351–352, 117–145 (2002).
5. J. V. Burke, A. S. Lewis, and M. L. Overton, “A robust gradient sampling algorithm for nonsmooth, nonconvex optimization,” SIAM J. Optim., 15, No. 3, 751–779 (2005).