| Hybrid backtracking bounded by tree-decomposition of constraint networks P Jégou, C Terrioux Artificial Intelligence 146 (1), 43-75, 2003 | 216 | 2003 |
| Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems P Jégou Proceedings of the Eleventh National Conference on Artificial Intelligence …, 1993 | 142 | 1993 |
| A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation P Janssen, P Jégou, B Nouguier, MC Vilarem IEEE International Workshop on Tools for Artificial Intelligence, 420,421 …, 1989 | 106 | 1989 |
| Efficient path-consistency propagation A Chmeiss, P Jégou International Journal on Artificial Intelligence Tools 7 (02), 121-142, 1998 | 79 | 1998 |
| Computing and exploiting tree-decompositions for solving constraint networks P Jégou, SN Ndiaye, C Terrioux Principles and Practice of Constraint Programming-CP 2005: 11th …, 2005 | 66 | 2005 |
| Bounded backtracking for the valued constraint satisfaction problems C Terrioux, P Jégou International Conference on Principles and Practice of Constraint …, 2003 | 59 | 2003 |
| On the consistency of general constraint-satisfaction problems P Jégou Proceedings of the eleventh national conference on Artificial intelligence …, 1993 | 59 | 1993 |
| Contribution à l'étude des problèmes de satisfaction de contraintes: algorithmes de propagation et de résolution: propagation de contraintes dans les réseaux dynamiques P Jégou Montpellier 2, 1991 | 59* | 1991 |
| Decomposition and good recording for solving Max-CSPs J Philippe, T Cyril Habilitation à Diriger des Recherches, 229, 2004 | 57 | 2004 |
| Davis and Putnam were already forward checking R Génisson, P Jégou Proc. ECAI 96, 180-184, 1996 | 30* | 1996 |
| Tree-decompositions with connected clusters for solving constraint networks P Jégou, C Terrioux International Conference on Principles and Practice of Constraint …, 2014 | 27 | 2014 |
| A hybrid tractable class for non-binary CSPs A El Mouelhi, P Jégou, C Terrioux Constraints 20, 383-413, 2015 | 25 | 2015 |
| Exploiting problem structure for solution counting A Favier, S De Givry, P Jégou International Conference on Principles and Practice of Constraint …, 2009 | 25 | 2009 |
| Problèmes de conception: une approche basée sur la satisfaction de contraintes P Janssen, P Jégou, B Nouguier, MC Vilarem 9ème Journées Internationales: les systèmes experts et leurs applications, 1989 | 24 | 1989 |
| Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. P Jégou, S Ndiaye, C Terrioux IJCAI, 112-117, 2007 | 23 | 2007 |
| On the notion of cycles in hypergraphs P Jégou, SN Ndiaye Discrete Mathematics 309 (23-24), 6535-6543, 2009 | 21 | 2009 |
| A generalization of chordal graphs and the maximum clique problem A Chmeiss, P Jégou Information Processing Letters 62 (2), 61-66, 1997 | 21 | 1997 |
| Path-consistency: when space misses time A Chmeiss, P Jégou Proceedings of the thirteenth national conference on Artificial intelligence …, 1996 | 21 | 1996 |
| A microstructure-based family of tractable classes for CSPs MC Cooper, P Jégou, C Terrioux International Conference on Principles and Practice of Constraint …, 2015 | 19 | 2015 |
| Hidden tractable classes: from theory to practice A El Mouelhi, P Jégou, C Terrioux 2014 IEEE 26th International Conference on Tools with Artificial …, 2014 | 19 | 2014 |
