A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. - P. Janssen; Philippe Jégou; B. Nouguier; Marie-Catherine Vilarem (TAI, 1989)

Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency. - Philippe Jégou (ECAI, 1990)

On the Consistency of General Constraint-Satisfaction Problems. - Philippe Jégou (AAAI, 1993)

Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems. - Philippe Jégou (AAAI, 1993)

On some partial line graphs of a hypergraph and the associated matroid. - Philippe Jégou; Marie-Catherine Vilarem (Discret. Math., 1993)

Solving Over-Constrained CSPs Using Weighted OBDDs. - Fabrice Bouquet; Philippe Jégou (Over-Constrained Systems, 1995)

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)

Davis and Putnam were Already Checking Forward. - Richard Génisson; Philippe Jégou (ECAI, 1996)

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

Using OBDDs to Handle Dynamic Constraints. - Fabrice Bouquet; Philippe Jégou (Inf. Process. Lett., 1997)

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)

On the relations between SAT and CSP enumerative algorithms. - Richard Génisson; Philippe Jégou (Discret. Appl. Math., 2000)

Bounded Backtracking for the Valued Constraint Satisfaction Problems. - Cyril Terrioux; Philippe Jégou (CP, 2003)

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

Hybrid backtracking bounded by tree-decomposition of constraint networks. - Philippe Jégou; Cyril Terrioux (Artif. Intell., 2003)

Decomposition and Good Recording for Solving Max-CSPs. - Philippe Jégou; Cyril Terrioux (ECAI, 2004)

A Time-Space Trade-Off for Constraint Networks Decomposition. - Philippe Jégou; Cyril Terrioux (ICTAI, 2004)

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. - Philippe Jégou; Samba Ndiaye; Cyril Terrioux (CP, 2005)

Proving Graph Un-Colorability with a Consistency Check of CSP. - Jean-Nicolas Bès; Philippe Jégou (ICTAI, 2005)

An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. - Philippe Jégou; Samba Ndiaye; Cyril Terrioux (CP, 2006)

(No)good Recording and ROBDDs for Solving Structured (V)CSPs. - Karim Boutaleb; Philippe Jégou; Cyril Terrioux (ICTAI, 2006)

Dynamic Management of Heuristics for Solving Structured CSPs. - Philippe Jégou; Samba Ndiaye; Cyril Terrioux (CP, 2007)

Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. - Philippe Jégou; Samba Ndiaye; Cyril Terrioux (IJCAI, 2007)

A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs. - Philippe Jégou; Samba Ndiaye; Cyril Terrioux (ICTAI (1), 2008)

Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. - Samba Ndiaye; Philippe Jégou; Cyril Terrioux (ICTAI (1), 2008)

Exploiting Problem Structure for Solution Counting. - Aurélie Favier; Simon de Givry; Philippe Jégou (CP, 2009)

Combined Strategies for Decomposition-Based Methods for Solving CSPs. - Philippe Jégou; Samba Ndiaye; Cyril Terrioux (ICTAI, 2009)

A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. - Philippe Jégou; Lionel Paris (SARA, 2009)

On the notion of cycles in hypergraphs. - Philippe Jégou; Samba Ndojh Ndiaye (Discret. Math., 2009)

Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report. - Djamal Habet; Philippe Jégou (Abstraction, Reformulation, and Approximation, 2010)

A New Filtering Based on Decomposition of Constraint Sub-Networks. - Philippe Jégou; Cyril Terrioux (ICTAI (1), 2010)

On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux; Bruno Zanuttini (ISAIM, 2012)

Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux; Bruno Zanuttini (CPAIOR, 2013)

Structural Consistency: A New Filtering Approach for Constraint Networks. - Philippe Jégou; Cyril Terrioux (GKR, 2013)

Different Classes of Graphs to Represent Microstructures for CSPs. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux (GKR, 2013)

Microstructures for CSPs with Constraints of Arbitrary Arity. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux (SARA, 2013)

Tree-Decompositions with Connected Clusters for Solving Constraint Networks. - Philippe Jégou; Cyril Terrioux (CP, 2014)

Combining Restarts, Nogoods and Decompositions for Solving CSPs. - Philippe Jégou; Cyril Terrioux (ECAI, 2014)

Hidden Tractable Classes: From Theory to Practice. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux (ICTAI, 2014)

Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. - Philippe Jégou; Cyril Terrioux (ISAIM, 2014)

The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. - Philippe Jégou; Cyril Terrioux (AAAI, 2015)

A Microstructure-Based Family of Tractable Classes for CSPs. - Martin C. Cooper; Philippe Jégou; Cyril Terrioux (CP, 2015)

An Algorithmic Framework for Decomposing Constraint Networks. - Philippe Jégou; Hanan Kanso; Cyril Terrioux (ICTAI, 2015)

A hybrid tractable class for non-binary CSPs. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux (Constraints An Int. J., 2015)

Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. - Philippe Jégou; Hanan Kanso; Cyril Terrioux (CP, 2016)

Improving Exact Solution Counting for Decomposition Methods. - Philippe Jégou; Hanan Kanso; Cyril Terrioux (ICTAI, 2016)

Weather Routing Optimization: A New Shortest Path Algorithm. - Estelle Chauveau; Philippe Jégou; Nicolas Prcovic (ICTAI, 2017)

Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs. - Philippe Jégou; Helene Kanso; Cyril Terrioux (ICTAI, 2017)

Combining restarts, nogoods and bag-connected decompositions for solving CSPs. - Philippe Jégou; Cyril Terrioux (Constraints An Int. J., 2017)

On the Relevance of Optimal Tree Decompositions for Constraint Networks. - Philippe Jégou; Hélène Kanso; Cyril Terrioux (ICTAI, 2018)

Computing partial hypergraphs of bounded width. - Nabil Adrar; Philippe Jégou; Cyril Terrioux (Discret. Appl. Math., 2023)

Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth. - Philippe Jégou (ISAIM, 2024)