1. Beldiceanu, N. (2000). Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type. Technical Report, Swedish Institute of Computer Science. SICS Technical Report T2000/01.
2. Beldiceanu, N. (2000). Global constraints as graph properties on a structured network of elementary constraints of the same type. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming (CP’00), LNCS 1894, Singapore, pages 52–66. Berlin Heidelberg New York: Springer.
3. Beldiceanu, N. (2001). Pruning for the minimum constraint family and for the number of distinct values constraint family. In Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP’01), LNCS 2239, Singapore, pages 211–224. Berlin Heidelberg New York: Springer.
4. Beldiceanu, N., & Carlsson, M. (2001). Revisiting the cardinality operator and introducing cardinality-path constraint family. In Proceedings ICLP’01, pages 59–73. Berlin Heidelberg New York: Springer.
5. Beldiceanu, N., & Contegean, E. (1994). Introducing global constraints in CHIP. Math. Comput. Model. 20(12): 97–123.