C.-M. Li and Z. Quan, “An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem”, AAAI, vol. 24, no. 1, pp. 128–133, Jul. 2010.