1. Beeri, C., Fagin, R., Maier, D., Yannakakis, M. (1983). On the desirability of acyclic database schemes. Journal of the ACM, 30, 479–513.
2. Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J. (2010). On matrices, automata, and double counting. In: A. Lodi, M. Milano, P. Toth (Eds.), CPAIOR 2010, LNCS (vol. 6140, pp. 10–24). Springer.
3. Beldiceanu, N., Carlsson, M., Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In: M.G. Wallace (Ed.), CP 2004, LNCS (vol. 3258, pp. 107–122). Springer.
4. Beldiceanu, N., Carlsson, M., Rampon, J.X. (2012). Global constraint catalog, 2nd edition (revision a). Tech. Rep. T2012:03. Swedish Institute of Computer Science. Available at http://soda.swedish-ict.se/5195/ . The current working version of the catalogue is at http://www.emn.fr/z-info/sdemasse/aux/doc/catalog.pdf .
5. Bessière, C., Hebrard, E., Hnich, B., Kızıltan, Z., Walsh, T. (2008). SLIDE: A useful special case of the CARDPATH constraint. In: M. Ghallab, et al. (Eds.), ECAI 2008 (pp. 475–479). IOS Press.