Li, C.-M. and Quan, Z. 2010. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. Proceedings of the AAAI Conference on Artificial Intelligence. 24, 1 (Jul. 2010), 128–133. DOI:https://doi.org/10.1609/aaai.v24i1.7536.