Cyril Terrioux

58 papers A* 5A 17B 13Misc 3Journal 10Unranked 9

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