C. Bessiere, E. H. Bouyakhf, Y. Mechqrane, and M. Wahbi, Agile asynchronous backtracking for distributed constraint satisfaction problems, Proceedings of ICTAI'11, pp.777-784, 2011.
DOI : 10.1109/ictai.2011.122
URL : https://hal.archives-ouvertes.fr/lirmm-00595688

C. Bessiere, A. Maestre, I. Brito, and P. Meseguer, Asynchronous backtracking without adding links: a new member in the ABT family, Artif. Intel, vol.161, pp.7-24, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00105347

C. Bessiere and J. C. Régin, MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems, Proceedings of CP'96, pp.61-75, 1996.

C. Bessiere and J. C. Régin, Refining the basic constraint propagation algorithm, Proceedings of IJCAI'01, pp.309-315, 2001.

C. Bliek, Generalizing partial order and dynamic backtracking, Proceedings of AAAI'98/IAAI'98, pp.319-325, 1998.

O. Bonnet-torrés and C. Tessier, Multiply-constrained dcop for distributed planning and scheduling, AAAI SSS: Distributed Plan and Schedule Management, pp.17-24, 2006.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of ECAI'04, pp.146-150, 2004.

M. L. Ginsberg, Dynamic Backtracking. JAIR 1, pp.25-46, 1993.
DOI : 10.1613/jair.1
URL : https://jair.org/index.php/jair/article/download/10107/23929

M. L. Ginsberg and D. A. Mcallester, GSAT and dynamic backtracking, pp.226-237, 1994.
DOI : 10.1007/3-540-58601-6_105
URL : http://www.ai.mit.edu/people/dam/dynamic2.ps

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artif. Intel, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-x

H. Jung, M. Tambe, and S. Kulkarni, Argumentation as Distributed Constraint Satisfaction: Applications and Results, Proceedings of AGENTS'01, pp.324-331, 2001.
DOI : 10.1145/375735.376322

R. Junges and A. L. Bazzan, Evaluating the performance of dcop algorithms in a real world, dynamic problem, Proceedings of AAMAS'08, pp.599-606, 2008.

T. Léauté and B. Faltings, Coordinating Logistics Operations with Privacy Guarantees, Proceedings of the IJCAI'11, pp.2482-2487, 2011.

C. Lecoutre, F. Boussemart, and F. Hemery, Backjump-Based Techniques versus Conflict-Directed Heuristics, Proceedings of IEEE ICTAI'04, pp.549-557, 2004.
DOI : 10.1109/ictai.2004.37
URL : http://www.cril.univ-artois.fr/%7Elecoutre/research/publications/2004/ICTAI2004.pdf

N. A. Lynch, Distributed Algorithms, 1997.

R. T. Maheswaran, M. Tambe, E. Bowring, J. P. Pearce, and P. Varakantham, Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling, Proceedings of AAMAS'04, 2004.

Y. Mechqrane, M. Wahbi, C. Bessiere, E. H. Bouyakhf, A. Meisels et al., Corrigendum to "Min-Domain Retroactive Ordering for Asynchronous Backtracking, Constraints, vol.17, pp.348-355, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00748174

B. Ottens and B. Faltings, Coordination agent plans trough distributed constraint optimization, Proceedings of MASPLAN'08. Sydney Australia, 2008.

A. Petcu and B. Faltings, A Value Ordering Heuristic for Distributed Resource Allocation, Proceedings of Joint Annual Workshop of ERCIM/CoLogNet on CSCLP'04, pp.86-97, 2004.

O. Roussel and C. Lecoutre, Xml representation of constraint networks: Format XCSP 2.1. CoRR, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00872825

M. C. Silaghi, Framework for modeling reordering heuristics for asynchronous backtracking, Intelligent Agent Technology, 2006. IAT'06. IEEE/WIC/ACM International Conference on, pp.529-536, 2006.

M. C. Silaghi, Generalized Dynamic Ordering for Asynchronous Backtracking on DisCSPs, Proceedings of DCR'06, 2006.

M. C. Silaghi, D. Sam-haroud, and B. , Faltings: ABT with Asynchronous Reordering, 2nd Asia-Pacific IAT, 2001.

M. C. Silaghi, D. Sam-haroud, M. Calisti, and B. Faltings, Generalized English Auctions by Relaxation in Dynamic Distributed CSPs with Private Constraints, Proceedings of DCR'01, pp.45-54, 2001.

M. Wahbi, Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00718537

M. Wahbi, R. Ezzahir, C. Bessiere, and E. H. Bouyakhf, DisChoco 2: A Platform for Distributed Constraint Reasoning, Proceedings of workshop on DCR'11, pp.112-121, 2011.

M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara, Distributed constraint satisfaction for formalizing distributed problem solving, Proceedings of ICDCS, pp.614-621, 1992.
DOI : 10.1109/icdcs.1992.235101

R. Zivan and A. Meisels, Parallel Backtrack search on DisCSPs, Proceedings of DCR'02, 2002.

R. Zivan and A. Meisels, Dynamic Ordering for Asynchronous Backtracking on DisCSPs, Constraints, vol.11, issue.2-3, pp.179-197, 2006.
DOI : 10.1007/11564751_6

R. Zivan and A. Meisels, Message delay and DisCSP search algorithms, AMAI, vol.46, issue.4, pp.415-439, 2006.
DOI : 10.1007/s10472-006-9033-2

R. Zivan, M. Zazone, and A. Meisels, Min-Domain Retroactive Ordering for Asynchronous Backtracking, Constraints, vol.14, issue.2, pp.177-198, 2009.
DOI : 10.1007/s10601-008-9046-z
URL : https://hal.archives-ouvertes.fr/lirmm-00748174