Cooperative Search and Nogood Recording. - Cyril Terrioux (IJCAI, 2001)

Recherche coopérative et Nogood Recording. - Cyril Terrioux (JFPLC, 2001)

Bounded Backtracking for the Valued Constraint Satisfaction Problems. - Cyril Terrioux; Philippe Jégou (CP, 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)

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)

A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving. - Cédric Pinto; Cyril Terrioux (ICTAI (1), 2008)

A Tree Decomposition Based Approach to Solve Structured SAT Instances. - Djamal Habet; Lionel Paris; Cyril Terrioux (ICTAI, 2009)

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

A Generalized Cyclic-Clustering Approach for Solving Structured CSPs. - Cédric Pinto; Cyril Terrioux (ICTAI, 2009)

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)

Classes polynomiales du problème CSP : entre théorie et pratique. - Cyril Terrioux (2016)

Extending Broken Triangles and Enhanced Value-Merging. - Martin C. Cooper; Achref El Mouelhi; Cyril Terrioux (CP, 2016)

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)

On Broken Triangles. - Martin C. Cooper; Achref El Mouelhi; Cyril Terrioux; Bruno Zanuttini (IJCAI, 2016)

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. - Martin C. Cooper; Aymeric Duchein; Achref El Mouelhi; Guillaume Escamocher; Cyril Terrioux; Bruno Zanuttini (Artif. Intell., 2016)

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)

Conflict History Based Branching Heuristic for CSP Solving. - Djamal Habet; Cyril Terrioux (CIMA@ICTAI, 2018)

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

Conflict history based search for constraint satisfaction problem. - Djamal Habet; Cyril Terrioux (SAC, 2019)

Variable Elimination in Binary CSPs. - Martin C. Cooper; Achref El Mouelhi; Cyril Terrioux (J. Artif. Intell. Res., 2019)

Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. - Yannick Carissan; Chisom-Adaobi Dim; Denis Hagebaum-Reignier; Nicolas Prcovic; Cyril Terrioux; Adrien Varet (CP, 2020)

Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. - Yannick Carissan; Denis Hagebaum-Reignier; Nicolas Prcovic; Cyril Terrioux; Adrien Varet (CP, 2020)

On the Refinement of Conflict History Search Through Multi-Armed Bandit. - Mohamed Sami Cherif; Djamal Habet; Cyril Terrioux (ICTAI, 2020)

Variable Elimination in Binary CSPs (Extended Abstract). - Martin C. Cooper; Achref El Mouelhi; Cyril Terrioux (IJCAI, 2020)

Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. - Yannick Carissan; Denis Hagebaum-Reignier; Nicolas Prcovic; Cyril Terrioux; Adrien Varet (CP, 2021)

Combining VSIDS and CHB Using Restarts in SAT. - Mohamed Sami Cherif; Djamal Habet; Cyril Terrioux (CP, 2021)

Conflict history based heuristic for constraint satisfaction problem solving. - Djamal Habet; Cyril Terrioux (J. Heuristics, 2021)

How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids. - Yannick Carissan; Denis Hagebaum-Reignier; Nicolas Prcovic; Cyril Terrioux; Adrien Varet (Constraints An Int. J., 2022)

BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming. - Adrien Varet; Nicolas Prcovic; Cyril Terrioux; Denis Hagebaum-Reignier; Yannick Carissan (J. Chem. Inf. Model., 2022)

A CP Approach for the Liner Shipping Network Design Problem. - Yousra El Ghazi; Djamal Habet; Cyril Terrioux (CP, 2023)

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

Cargo Routing Optimization in Liner Shipping Networks. - Yousra El Ghazi; Djamal Habet; Cyril Terrioux (CP, 2025)