1. Achlioptas, D., Molloy, M., Kirousis, L., Stamatiou, Y., Kranakis, E., Krizanc, D.: Random constraint satisfaction: a more accurate picture. Constraints 6(4), 329–344 (2001)
2. Ansótegui, C., Béjar, R., Fernández, C., Gomes, C.P., Mateu, C.: The impact of balancing on problem hardness in a highly structured domain. In: Proceedings of AAAI, pp. 10–15 (2016)
3. Ansótegui, C., Béjar, R., Fernández, C., Gomes, C.P., Mateu, C.: Generating highly balanced sudoku problems as hard problems. J. Heuristics 17(5), 589–614 (2011)
4. Ansótegui, C., Béjar, R., Fernàndez, C., Mateu, C.: On balanced CSPs with high treewidth. In: Proceedings of AAAI, vol. 1, pp. 161–166 (2007)
5. Bollobás, B.: Random Graphs. Cambridge Studies in Advanced Mathematics (2001)