default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAchref El Mouelhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c13]Martin C. Cooper
, Achref El Mouelhi, Cyril Terrioux:
Variable Elimination in Binary CSPs (Extended Abstract). IJCAI 2020: 5035-5039
2010 – 2019
- 2019
- [j5]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Variable Elimination in Binary CSPs. J. Artif. Intell. Res. 66: 589-624 (2019) - [i1]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Variable elimination in binary CSPs. CoRR abs/1905.04209 (2019) - 2018
- [j4]Achref El Mouelhi:
On a new extension of BTP for binary CSPs. Constraints An Int. J. 23(4): 355-382 (2018) - 2017
- [j3]Achref El Mouelhi:
Tractable classes for CSPs of arbitrary arity: from theory to practice. Constraints An Int. J. 22(1): 97-98 (2017) - [c12]Achref El Mouelhi:
A BTP-Based Family of Variable Elimination Rules for Binary CSPs. AAAI 2017: 3871-3877 - 2016
- [j2]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: 196-218 (2016) - [c11]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux:
Extending Broken Triangles and Enhanced Value-Merging. CP 2016: 173-188 - [c10]Achref El Mouelhi:
Constraint Decomposition Based on Tractable Properties. ICTAI 2016: 226-230 - [c9]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. IJCAI 2016: 4135-4139 - 2015
- [j1]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) - [c8]Achref El Mouelhi:
On the Decomposition of Non-binary Constraint into Equivalent Binary Constraints. ICTAI 2015: 9-16 - 2014
- [c7]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. CP 2014: 9-24 - [c6]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Hidden Tractable Classes: From Theory to Practice. ICTAI 2014: 437-445 - 2013
- [c5]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 - [c4]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Different Classes of Graphs to Represent Microstructures for CSPs. GKR 2013: 21-38 - [c3]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
A Hybrid Tractable Class for Non-binary CSPs. ICTAI 2013: 947-954 - [c2]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Microstructures for CSPs with Constraints of Arbitrary Arity. SARA 2013 - 2012
- [c1]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM 2012
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 2025-01-09 12:54 CET 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:
