N. Beldiceanu, Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family, CP, pp.211-224, 2001.
DOI : 10.1007/3-540-45578-7_15

C. Bessì-ere, E. Hébrard, B. Hnich, Z. Kiziltan, and T. Walsh, Filtering Algorithms for the NValue Constraint, CPAIOR'05, pp.79-93, 2005.

C. Bessì-ere, E. Hébrard, B. Hnich, and T. Walsh, The Complexity of Global Constraints, AAAI'04, pp.112-117, 2004.

G. Chabert and L. Jaulin, Contractor programming, Artificial Intelligence, vol.173, issue.11, pp.1079-1100, 2009.
DOI : 10.1016/j.artint.2009.03.002
URL : https://hal.archives-ouvertes.fr/hal-00428957

U. I. Gupta, D. T. Lee, and Y. T. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks, vol.9, issue.4, pp.459-467, 1982.
DOI : 10.1002/net.3230120410

L. Jaulin, Localization of an Underwater Robot Using Interval Constraint Propagation, 2006.
DOI : 10.1007/11889205_19
URL : https://hal.archives-ouvertes.fr/hal-00449523

L. Jaulin, A Nonlinear Set Membership Approach for the Localization and Map Building of Underwater Robots, IEEE Transactions on Robotics, vol.25, issue.1, pp.88-98, 2009.
DOI : 10.1109/TRO.2008.2010358

R. Moore, Interval Analysis, 1966.

C. S. Rim and K. Nakajima, On rectangle intersection and overlap graphs, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol.42, issue.9, pp.549-553, 1995.
DOI : 10.1109/81.414831

R. Tamassia and I. G. Tollis, Planar grid embedding in linear time, IEEE Transactions on Circuits and Systems, vol.36, issue.9, pp.1230-1234, 1989.
DOI : 10.1109/31.34669

R. Uehara, NP-Complete Problems on a 3-connected Cubic Planar Graph and their Applications, 1996.