1. Beliakov, G.: Monotonicity preserving approximation of multivariate scattered data. BIT Numer. Math. 45, 653–677 (2005)
2. Blanchette, M., Kim, E., Vetta, A.: Clique cover on sparse networks. In: Bader, D.A., Mutzel, P. (eds.) ALENEX, pp. 93–102. SIAM (2012)
3. Cerioli, M.R., Faria, L., Ferreira, T.O., Martinhon, C.A.J., Protti, F., Reed, B.A.: Partition into cliques for cubic graphs: planar case, complexity and approximation. Discret. Appl. Math. 156(12), 2270–2278 (2008)
4. Chalupa, D.: On the efficiency of an order-based representation in the clique covering problem. In: Soule, T., Moore, J.H. (eds.) GECCO, pp. 353–360. ACM (2012)
5. Chalupa, D.: Construction of near-optimal vertex clique covering for real-world networks. Comput. Inf. 34(6), 1397–1417 (2015)