Cyril Terrioux

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 27

Top Topics

Tree Decompositions

Constraint Programming

Decomposition Method

Top Venues

Constraints An Int. J.

Publications

Nabil Adrar, Philippe Jégou, Cyril Terrioux
Computing partial hypergraphs of bounded width. Discret. Appl. Math. 329 (2023)
Yousra El Ghazi, Djamal Habet, Cyril Terrioux
A CP Approach for the Liner Shipping Network Design Problem. CP (2023)
Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet
How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids. Constraints An Int. J. 27 (3) (2022)
Adrien Varet, Nicolas Prcovic, Cyril Terrioux, Denis Hagebaum-Reignier, Yannick Carissan
BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming. J. Chem. Inf. Model. 62 (11) (2022)
Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. CP (2021)
Djamal Habet, Cyril Terrioux
Conflict history based heuristic for constraint satisfaction problem solving. J. Heuristics 27 (6) (2021)
Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux
Combining VSIDS and CHB Using Restarts in SAT. CP (2021)
Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux
On the Refinement of Conflict History Search Through Multi-Armed Bandit. ICTAI (2020)
Yannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet
Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. CP (2020)
Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet
Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. CP (2020)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
Variable Elimination in Binary CSPs (Extended Abstract). IJCAI (2020)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
Variable elimination in binary CSPs. CoRR (2019)
Djamal Habet, Cyril Terrioux
Conflict history based search for constraint satisfaction problem. SAC (2019)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
Variable Elimination in Binary CSPs. J. Artif. Intell. Res. 66 (2019)
Djamal Habet, Cyril Terrioux
Conflict History Based Branching Heuristic for CSP Solving. CIMA@ICTAI (2018)
Philippe Jégou, Hélène Kanso, Cyril Terrioux
On the Relevance of Optimal Tree Decompositions for Constraint Networks. ICTAI (2018)
Philippe Jégou, Cyril Terrioux
Combining restarts, nogoods and bag-connected decompositions for solving CSPs. Constraints An Int. J. 22 (2) (2017)
Philippe Jégou, Helene Kanso, Cyril Terrioux
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs. ICTAI (2017)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
Extending Broken Triangles and Enhanced Value-Merging. CP (2016)
Philippe Jégou, Hanan Kanso, Cyril Terrioux
Improving Exact Solution Counting for Decomposition Methods. ICTAI (2016)
Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234 (2016)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini
On Broken Triangles. IJCAI (2016)
Philippe Jégou, Hanan Kanso, Cyril Terrioux
Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. CP (2016)
Philippe Jégou, Hanan Kanso, Cyril Terrioux
An Algorithmic Framework for Decomposing Constraint Networks. ICTAI (2015)
Philippe Jégou, Cyril Terrioux
The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. AAAI (2015)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
A hybrid tractable class for non-binary CSPs. Constraints An Int. J. 20 (4) (2015)
Martin C. Cooper, Philippe Jégou, Cyril Terrioux
A Microstructure-Based Family of Tractable Classes for CSPs. CP (2015)
Philippe Jégou, Cyril Terrioux
Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. ISAIM (2014)
Philippe Jégou, Cyril Terrioux
Tree-Decompositions with Connected Clusters for Solving Constraint Networks. CP (2014)
Philippe Jégou, Cyril Terrioux
Combining Restarts, Nogoods and Decompositions for Solving CSPs. ECAI (2014)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini
On Broken Triangles. CP (2014)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Hidden Tractable Classes: From Theory to Practice. ICTAI (2014)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Microstructures for CSPs with Constraints of Arbitrary Arity. SARA (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. CPAIOR (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Different Classes of Graphs to Represent Microstructures for CSPs. GKR (2013)
Philippe Jégou, Cyril Terrioux
Structural Consistency: A New Filtering Approach for Constraint Networks. GKR (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
A Hybrid Tractable Class for Non-binary CSPs. ICTAI (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM (2012)
Philippe Jégou, Cyril Terrioux
A New Filtering Based on Decomposition of Constraint Sub-Networks. ICTAI (1) (2010)
Djamal Habet, Lionel Paris, Cyril Terrioux
A Tree Decomposition Based Approach to Solve Structured SAT Instances. ICTAI (2009)
Cédric Pinto, Cyril Terrioux
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs. ICTAI (2009)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Combined Strategies for Decomposition-Based Methods for Solving CSPs. ICTAI (2009)
Samba Ndiaye, Philippe Jégou, Cyril Terrioux
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. ICTAI (1) (2008)
Cédric Pinto, Cyril Terrioux
A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving. ICTAI (1) (2008)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs. ICTAI (1) (2008)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Dynamic Management of Heuristics for Solving Structured CSPs. CP (2007)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. IJCAI (2007)
Karim Boutaleb, Philippe Jégou, Cyril Terrioux
(No)good Recording and ROBDDs for Solving Structured (V)CSPs. ICTAI (2006)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. CP (2006)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. CP (2005)
Philippe Jégou, Cyril Terrioux
A Time-Space Trade-Off for Constraint Networks Decomposition. ICTAI (2004)
Philippe Jégou, Cyril Terrioux
Decomposition and Good Recording for Solving Max-CSPs. ECAI (2004)
Cyril Terrioux, Philippe Jégou
Bounded Backtracking for the Valued Constraint Satisfaction Problems. CP (2003)
Philippe Jégou, Cyril Terrioux
Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146 (1) (2003)
Cyril Terrioux
Recherche coopérative et Nogood Recording. JFPLC (2001)
Cyril Terrioux
Cooperative Search and Nogood Recording. IJCAI (2001)