| 2025 | CP | Cargo Routing Optimization in Liner Shipping Networks. | Yousra El Ghazi, Djamal Habet, Cyril Terrioux |
| 2023 | CP | A CP Approach for the Liner Shipping Network Design Problem. | Yousra El Ghazi, Djamal Habet, Cyril Terrioux |
| 2021 | CP | Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. | Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet |
| 2021 | CP | Combining VSIDS and CHB Using Restarts in SAT. | Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux |
| 2020 | CP | Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. | Yannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet |
| 2020 | CP | Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. | Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet |
| 2020 | IJCAI | Variable Elimination in Binary CSPs (Extended Abstract). | Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux |
| 2020 | ICTAI | On the Refinement of Conflict History Search Through Multi-Armed Bandit. | Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux |
| 2019 | SAC | Conflict history based search for constraint satisfaction problem. | Djamal Habet, Cyril Terrioux |
| 2018 | ICTAI | Conflict History Based Branching Heuristic for CSP Solving. | Djamal Habet, Cyril Terrioux |
| 2018 | ICTAI | On the Relevance of Optimal Tree Decompositions for Constraint Networks. | Philippe Jgou, Hlne Kanso, Cyril Terrioux |
| 2017 | ICTAI | Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs. | Philippe Jgou, Helene Kanso, Cyril Terrioux |
| 2016 | CP | Extending Broken Triangles and Enhanced Value-Merging. | Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux |
| 2016 | CP | Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. | Philippe Jgou, Hanan Kanso, Cyril Terrioux |
| 2016 | IJCAI | On Broken Triangles. | Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini |
| 2016 | ICTAI | Improving Exact Solution Counting for Decomposition Methods. | Philippe Jgou, Hanan Kanso, Cyril Terrioux |
| 2015 | AAAI | The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. | Philippe Jgou, Cyril Terrioux |
| 2015 | CP | A Microstructure-Based Family of Tractable Classes for CSPs. | Martin C. Cooper, Philippe Jgou, Cyril Terrioux |
| 2015 | ICTAI | An Algorithmic Framework for Decomposing Constraint Networks. | Philippe Jgou, Hanan Kanso, Cyril Terrioux |
| 2014 | CP | On Broken Triangles. | Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini |
| 2014 | CP | Tree-Decompositions with Connected Clusters for Solving Constraint Networks. | Philippe Jgou, Cyril Terrioux |
| 2014 | ECAI | Combining Restarts, Nogoods and Decompositions for Solving CSPs. | Philippe Jgou, Cyril Terrioux |
| 2014 | ISAIM | Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. | Philippe Jgou, Cyril Terrioux |
| 2014 | ICTAI | Hidden Tractable Classes: From Theory to Practice. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux |
| 2013 | CPAIOR | Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux, Bruno Zanuttini |
| 2013 | ICTAI | A Hybrid Tractable Class for Non-binary CSPs. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux |
| 2012 | ISAIM | On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux, Bruno Zanuttini |
| 2010 | ICTAI | A New Filtering Based on Decomposition of Constraint Sub-Networks. | Philippe Jgou, Cyril Terrioux |
| 2009 | ICTAI | A Tree Decomposition Based Approach to Solve Structured SAT Instances. | Djamal Habet, Lionel Paris, Cyril Terrioux |
| 2009 | ICTAI | Combined Strategies for Decomposition-Based Methods for Solving CSPs. | Philippe Jgou, Samba Ndiaye, Cyril Terrioux |
| 2009 | ICTAI | A Generalized Cyclic-Clustering Approach for Solving Structured CSPs. | Cdric Pinto, Cyril Terrioux |
| 2008 | ICTAI | A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs. | Philippe Jgou, Samba Ndiaye, Cyril Terrioux |
| 2008 | ICTAI | Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. | Samba Ndiaye, Philippe Jgou, Cyril Terrioux |
| 2008 | ICTAI | A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving. | Cdric Pinto, Cyril Terrioux |
| 2007 | CP | Dynamic Management of Heuristics for Solving Structured CSPs. | Philippe Jgou, Samba Ndiaye, Cyril Terrioux |
| 2007 | IJCAI | Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. | Philippe Jgou, Samba Ndiaye, Cyril Terrioux |
| 2006 | CP | An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. | Philippe Jgou, Samba Ndiaye, Cyril Terrioux |
| 2006 | ICTAI | (No)good Recording and ROBDDs for Solving Structured (V)CSPs. | Karim Boutaleb, Philippe Jgou, Cyril Terrioux |
| 2005 | CP | Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. | Philippe Jgou, Samba Ndiaye, Cyril Terrioux |
| 2004 | ECAI | Decomposition and Good Recording for Solving Max-CSPs. | Philippe Jgou, Cyril Terrioux |
| 2004 | ICTAI | A Time-Space Trade-Off for Constraint Networks Decomposition. | Philippe Jgou, Cyril Terrioux |
| 2003 | CP | Bounded Backtracking for the Valued Constraint Satisfaction Problems. | Cyril Terrioux, Philippe Jgou |
| 2001 | IJCAI | Cooperative Search and Nogood Recording. | Cyril Terrioux |