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), pp. 128–133. doi: 10.1609/aaai.v24i1.7536.