1. F. Alizadeh. Combinatorial optimization with interior point methods and semidefinite matrices. PhD thesis, University of Minnesota, Minneapolis, MN, 1991.
2. K. M. Anstreicher and M. Fampa. A long-step path following algorithm for semidefinite programming problems. Working Paper, Department of Management Science, The University of Iowa, Iowa City, IA, 1996.
3. L. Babel. Finding maximum cliques in arbitrary and in special graphs. Computing, 46:321–341, 1991.
4. L. Babel and G. Tinhofer. A branch and bound algorithm for the maximum clique problem. J. of Global Optimization, 4, 1994.
5. Egon Balas and H. Samuelsson. A node covering algorithm. Naval Research Logistics Quarterly, 24(2):213–233, 1977.