default search action
Cyril Terrioux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Nabil Adrar, Philippe Jégou, Cyril Terrioux
:
Computing partial hypergraphs of bounded width. Discret. Appl. Math. 329: 1-22 (2023) - [c46]Yousra El Ghazi, Djamal Habet, Cyril Terrioux:
A CP Approach for the Liner Shipping Network Design Problem. CP 2023: 16:1-16:21 - 2022
- [j8]Yannick Carissan
How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids. Constraints An Int. J. 27(3): 192-248 (2022) - [j7]Adrien Varet, Nicolas Prcovic, Cyril Terrioux
BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming. J. Chem. Inf. Model. 62(11): 2811-2820 (2022) - 2021
- [j6]Djamal Habet, Cyril Terrioux
Conflict history based heuristic for constraint satisfaction problem solving. J. Heuristics 27(6): 951-990 (2021) - [c45]Yannick Carissan
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. CP 2021: 19:1-19:18 - [c44]Mohamed Sami Cherif
Combining VSIDS and CHB Using Restarts in SAT. CP 2021: 20:1-20:19 - 2020
- [c43]Yannick Carissan
Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. CP 2020: 673-689 - [c42]Yannick Carissan
Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. CP 2020: 690-706 - [c41]Mohamed Sami Cherif
On the Refinement of Conflict History Search Through Multi-Armed Bandit. ICTAI 2020: 264-271 - [c40]Martin C. Cooper
Variable Elimination in Binary CSPs (Extended Abstract). IJCAI 2020: 5035-5039
2010 – 2019
- 2019
- [j5]Martin C. Cooper
Variable Elimination in Binary CSPs. J. Artif. Intell. Res. 66: 589-624 (2019) - [c39]Djamal Habet, Cyril Terrioux:
Conflict history based search for constraint satisfaction problem. SAC 2019: 1117-1122 - [i1]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
Variable elimination in binary CSPs. CoRR abs/1905.04209 (2019) - 2018
- [c38]Djamal Habet, Cyril Terrioux:
Conflict History Based Branching Heuristic for CSP Solving. CIMA@ICTAI 2018: 70-80 - [c37]Philippe Jégou, Hélène Kanso, Cyril Terrioux:
On the Relevance of Optimal Tree Decompositions for Constraint Networks. ICTAI 2018: 738-743 - 2017
- [j4]Philippe Jégou, Cyril Terrioux:
Combining restarts, nogoods and bag-connected decompositions for solving CSPs. Constraints An Int. J. 22(2): 191-229 (2017) - [c36]Philippe Jégou, Helene Kanso, Cyril Terrioux:
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs. ICTAI 2017: 366-373 - 2016
- [b1]Cyril Terrioux:
Classes polynomiales du problème CSP : entre théorie et pratique. Aix-Marseille University, France, 2016 - [j3]Martin C. Cooper
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234: 196-218 (2016) - [c35]Martin C. Cooper
Extending Broken Triangles and Enhanced Value-Merging. CP 2016: 173-188 - [c34]Philippe Jégou, Hanan Kanso, Cyril Terrioux:
Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. CP 2016: 298-315 - [c33]Philippe Jégou, Hanan Kanso, Cyril Terrioux:
Improving Exact Solution Counting for Decomposition Methods. ICTAI 2016: 327-334 - [c32]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. IJCAI 2016: 4135-4139 - 2015
- [j2]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
A hybrid tractable class for non-binary CSPs. Constraints An Int. J. 20(4): 383-413 (2015) - [c31]Philippe Jégou, Cyril Terrioux:
The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. AAAI 2015: 3746-3754 - [c30]Martin C. Cooper
A Microstructure-Based Family of Tractable Classes for CSPs. CP 2015: 74-88 - [c29]Philippe Jégou, Hanan Kanso, Cyril Terrioux:
An Algorithmic Framework for Decomposing Constraint Networks. ICTAI 2015: 1-8 - 2014
- [c28]Martin C. Cooper
On Broken Triangles. CP 2014: 9-24 - [c27]Philippe Jégou, Cyril Terrioux:
Tree-Decompositions with Connected Clusters for Solving Constraint Networks. CP 2014: 407-423 - [c26]Philippe Jégou, Cyril Terrioux:
Combining Restarts, Nogoods and Decompositions for Solving CSPs. ECAI 2014: 465-470 - [c25]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Hidden Tractable Classes: From Theory to Practice. ICTAI 2014: 437-445 - [c24]Philippe Jégou, Cyril Terrioux:
Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. ISAIM 2014 - 2013
- [c23]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. CPAIOR 2013: 61-76 - [c22]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Different Classes of Graphs to Represent Microstructures for CSPs. GKR 2013: 21-38 - [c21]Philippe Jégou, Cyril Terrioux:
Structural Consistency: A New Filtering Approach for Constraint Networks. GKR 2013: 74-91 - [c20]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
A Hybrid Tractable Class for Non-binary CSPs. ICTAI 2013: 947-954 - [c19]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Microstructures for CSPs with Constraints of Arbitrary Arity. SARA 2013 - 2012
- [c18]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM 2012 - 2010
- [c17]Philippe Jégou, Cyril Terrioux:
A New Filtering Based on Decomposition of Constraint Sub-Networks. ICTAI (1) 2010: 263-270
2000 – 2009
- 2009
- [c16]Djamal Habet, Lionel Paris, Cyril Terrioux:
A Tree Decomposition Based Approach to Solve Structured SAT Instances. ICTAI 2009: 115-122 - [c15]Philippe Jégou, Samba Ndiaye
Combined Strategies for Decomposition-Based Methods for Solving CSPs. ICTAI 2009: 184-192 - [c14]Cédric Pinto, Cyril Terrioux:
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs. ICTAI 2009: 724-728 - 2008
- [c13]Samba Ndiaye, Philippe Jégou, Cyril Terrioux:
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. ICTAI (1) 2008: 299-306 - [c12]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: 486-490 - [c11]Cédric Pinto, Cyril Terrioux:
A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving. ICTAI (1) 2008: 491-495 - 2007
- [c10]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Dynamic Management of Heuristics for Solving Structured CSPs. CP 2007: 364-378 - [c9]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. IJCAI 2007: 112-117 - 2006
- [c8]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. CP 2006: 741-745 - [c7]Karim Boutaleb, Philippe Jégou, Cyril Terrioux:
(No)good Recording and ROBDDs for Solving Structured (V)CSPs. ICTAI 2006: 297-304 - 2005
- [c6]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. CP 2005: 777-781 - 2004
- [c5]Philippe Jégou, Cyril Terrioux:
Decomposition and Good Recording for Solving Max-CSPs. ECAI 2004: 196-200 - [c4]Philippe Jégou, Cyril Terrioux:
A Time-Space Trade-Off for Constraint Networks Decomposition. ICTAI 2004: 234-239 - 2003
- [j1]Philippe Jégou, Cyril Terrioux:
Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146(1): 43-75 (2003) - [c3]Cyril Terrioux, Philippe Jégou:
Bounded Backtracking for the Valued Constraint Satisfaction Problems. CP 2003: 709-723 - 2001
- [c2]Cyril Terrioux:
Cooperative Search and Nogood Recording. IJCAI 2001: 260-265 - [c1]Cyril Terrioux:
Recherche coopérative et Nogood Recording. JFPLC 2001: 173-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: