Path-Consistency: When Space Misses Time. - Assef Chmeiss; Philippe Jégou (AAAI/IAAI, Vol. 1, 1996)

Efficient Constraint Propagation With Good Space Complexity. - Assef Chmeiss; Philippe Jégou (CP, 1996)

Two New Donstraint Propagation Algorithms Requiring Small Space Complexity. - Assef Chmeiss; Philippe Jégou (ICTAI, 1996)

A Generalization of Chordal Graphs and the Maximum Clique Problem. - Assef Chmeiss; Philippe Jégou (Inf. Process. Lett., 1997)

Efficient Path-Consistency Propagation. - Assef Chmeiss; Philippe Jégou (Int. J. Artif. Intell. Tools, 1998)

About the use of local consistency in solving CSPs. - Assef Chmeiss; Lakhdar Sais (ICTAI, 2000)

Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. - Christian Bessière; Assef Chmeiss; Lakhdar Sais (CP, 2001)

On a generalization of triangulated graphs for domains decomposition of CSPs. - Assef Chmeiss; Philippe Jégou; Lamia Keddar (IJCAI, 2003)

Constraint Satisfaction Problems: Backtrack Search Revisited. - Assef Chmeiss; Lakhdar Sais (ICTAI, 2004)

Light Integration of Path Consistency for Solving CSPs. - Assef Chmeiss; Vincent Krawczyk; Lakhdar Sais (ICTAI (1), 2007)

Redundancy in CSPs. - Assef Chmeiss; Vincent Krawczyk; Lakhdar Sais (ECAI, 2008)

Consistency of Triangulated Temporal Qualitative Constraint Networks. - Assef Chmeiss; Jean-François Condotta (ICTAI, 2011)