1. Aho, A., Hopcroft, J., & Ullman, J. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. Bessiere, C., Hebrard, E., Hnich, B., & Walsh, T. (2004). The complexity of global constraints. In McGuinness, Deborah L. & Ferguson, George, eds., Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, pages 112–117. AAAI Press/The MIT Press .
3. Bessiere, C., Hebrard, E., Hnich, B., & Walsh, T. (2004). The tractability of global constraints. In Wallace, M., ed., Principles and Practice of Constraint Programming (CP 2004), volume 3258 of LNCS, Springer-Verlag, pages 716–720.
4. Caseau, Y., Guillo, P.-Y., & Levenez, E. (1993). A deductive and object-oriented approach to a complex scheduling problem. In Deductive and Object-Oriented Databases, pages 67–80.
5. Gabow, H. N., & Tarjan, R. E. (1985). A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2): 209–221.