default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohamed Siala 0002
Person information
- affiliation: University of Toulouse, LAAS-CNRS, France
- affiliation: INSA Toulouse, France
- affiliation (former): University College Cork, Ireland
Other persons with the same name
- Mohamed Siala 0001
![[0000-0002-5801-1656]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5801-1656")
— University of Carthage, Tunis, Tunisia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Probabilistic Dataset Reconstruction from Interpretable Models. SaTML 2024: 1-17- 2023
- [j8]Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Improving fairness generalization through a sample-robust optimization method. Mach. Learn. 112(6): 2131-2192 (2023) - [c21]Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Exploiting Fairness to Enhance Sensitive Attributes Reconstruction. SaTML 2023: 18-41 - [i8]Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Probabilistic Dataset Reconstruction from Interpretable Models. CoRR abs/2308.15099 (2023) - [i7]Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
SoK: Taming the Triangle - On the Interplays between Fairness, Interpretability and Privacy in Machine Learning. CoRR abs/2312.16191 (2023) - 2022
- [c20]Hao Hu, Marie-José Huguet, Mohamed Siala:
Optimizing Binary Decision Diagrams with MaxSAT for Classification. AAAI 2022: 3767-3775 - [c19]Ulrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists. CPAIOR 2022: 103-119 - [i6]Hao Hu, Marie-José Huguet, Mohamed Siala:
Optimizing Binary Decision Diagrams with MaxSAT for classification. CoRR abs/2203.11386 (2022) - [i5]Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Exploiting Fairness to Enhance Sensitive Attributes Reconstruction. CoRR abs/2209.01215 (2022) - 2021
- [c18]Ulrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
FairCORELS, an Open-Source Library for Learning Fair Rule Lists. CIKM 2021: 4665-4669 - 2020
- [j7]Mark Antunes, Vincent Armant, Kenneth N. Brown, Daniel A. Desmond, Guillaume Escamocher, Anne-Marie George, Diarmuid Grimes, Mike O'Keeffe, Yiqing Lin, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Mohamed Siala, Helmut Simonis, Nic Wilson:
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. Int. J. Artif. Intell. Tools 29(03n04): 2060007:1-2060007:31 (2020) - [c17]Alexey Ignatiev, Martin C. Cooper, Mohamed Siala, Emmanuel Hebrard, João Marques-Silva:
Towards Formal Fairness in Machine Learning. CP 2020: 846-867 - [c16]Hao Hu, Mohamed Siala, Emmanuel Hebrard, Marie-José Huguet:
Learning Optimal Decision Trees with MaxSAT and its Integration in AdaBoost. IJCAI 2020: 1170-1176
2010 – 2019
- 2019
- [j6]Mohamed Siala, Barry O'Sullivan:
Combinatorial search from an energy perspective. Inf. Process. Lett. 148: 23-27 (2019) - [j5]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
Complexity Study for the Robust Stable Marriage Problem. Theor. Comput. Sci. 775: 76-92 (2019) - [c15]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem. CPAIOR 2019: 320-336 - [i4]Ulrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala:
Learning Fair Rule Lists. CoRR abs/1909.03977 (2019) - 2018
- [c14]Guillaume Escamocher, Mohamed Siala, Barry O'Sullivan:
From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP. CPAIOR 2018: 198-214 - [c13]Mark Antunes, Vincent Armant, Kenneth N. Brown, Daniel A. Desmond, Guillaume Escamocher, Anne-Marie George, Diarmuid Grimes, Mike O'Keeffe, Yiqing Lin, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Mohamed Siala, Helmut Simonis, Nic Wilson:
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. ICTAI 2018: 114-121 - 2017
- [c12]Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Robust Stable Marriage. AAAI 2017: 4925-4926 - [c11]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
On the Complexity of Robust Stable Marriage. COCOA (2) 2017: 441-448 - [c10]Mohamed Siala, Barry O'Sullivan:
Rotation-Based Formulation for Stable Matching. CP 2017: 262-277 - [c9]Emmanuel Hebrard, Mohamed Siala:
Explanation-Based Weighted Degree. CPAIOR 2017: 167-175 - [c8]Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
New Models for Two Variants of Popular Matching. ICTAI 2017: 752-759 - [c7]Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Finding Robust Solutions to Stable Marriage. IJCAI 2017: 631-637 - [i3]Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Finding Robust Solutions to Stable Marriage. CoRR abs/1705.09218 (2017) - [i2]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
On the Complexity of Robust Stable Marriage. CoRR abs/1709.06172 (2017) - 2016
- [j4]Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh:
Three generalizations of the FOCUS constraint. Constraints An Int. J. 21(4): 495-532 (2016) - [c6]Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
A CP-Based Approach for Popular Matching. AAAI 2016: 4202-4203 - [c5]Mohamed Siala, Barry O'Sullivan:
Revisiting Two-Sided Stability Constraints. CPAIOR 2016: 342-357 - 2015
- [b1]Mohamed Siala:
Search, propagation, and learning in sequencing and scheduling problems. (Recherche, propagation et apprentissage dans les problèmes de séquencement et d'ordonnancement). INSA Toulouse, France, 2015 - [j3]Mohamed Siala:
Search, propagation, and learning in sequencing and scheduling problems. Constraints An Int. J. 20(4): 479-480 (2015) - [j2]Mohamed Siala, Emmanuel Hebrard, Marie-José Huguet:
A study of constraint programming heuristics for the car-sequencing problem. Eng. Appl. Artif. Intell. 38: 34-44 (2015) - [c4]Mohamed Siala, Christian Artigues, Emmanuel Hebrard:
Two Clause Learning Approaches for Disjunctive Scheduling. CP 2015: 393-402 - 2014
- [j1]Mohamed Siala, Emmanuel Hebrard, Marie-José Huguet:
An optimal arc consistency algorithm for a particular case of sequence constraint. Constraints An Int. J. 19(1): 30-56 (2014) - [c3]Christian Artigues, Emmanuel Hebrard, Valentin Mayer-Eichberger, Mohamed Siala, Toby Walsh:
SAT and Hybrid Models of the Car Sequencing Problem. CPAIOR 2014: 268-283 - 2013
- [c2]Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh:
Three Generalizations of the FOCUS Constraint. IJCAI 2013: 630-636 - [i1]Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh:
Three Generalizations of the FOCUS Constraint. CoRR abs/1304.5970 (2013) - 2012
- [c1]Mohamed Siala, Emmanuel Hebrard, Marie-José Huguet:
An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality. CP 2012: 55-69
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-21 00:10 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:
