1. Aho, A., Sagiv, Y., Szymanski, T., & Ullman, J. D. (1981). Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal of Computing, 10(3), 405–421.
2. Beldiceanu, N., Carlsson, M., & Rampon, J.-X. (2005). Global constraint catalog. Research Report T2005-08, Swedish Institute of Computer Science.
3. Beldiceanu, N., Flener, P., & Lorca, X. (2005). The tree constraint. In Proceedings of CP-AI-OR ’05, LNCS (Vol. 3524, pp. 64–78). Springer.
4. Beldiceanu, N., Flener, P., & Lorca, X. (2006). Combining tree partitioning, precedence, incomparability, and degree constraints, with an application to phylogenetic and ordered-path problems. Technical Report 2006-020, Department of Information Technology, Uppsala University, Sweden. Available at http://www.it.uu.se/research/publications/reports/2006-020/ .
5. Beldiceanu, N., Flener, P., & Lorca, X. (2006). Partitionnement de graphes par des arbres sous contraintes de degré. In Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC’06) (pp. 35–42). (in French).