default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Szczepanski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski:
Designing an XAI Interface for Tree-Based ML Models. ECAI 2024: 1075-1082- [c13]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
On the Computation of Example-Based Abductive Explanations for Random Forests. IJCAI 2024: 3679-3687 - [c12]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Deriving Provably Correct Explanations for Decision Trees: The Impact of Domain Theories. IJCAI 2024: 3688-3696 - [c11]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
PyXAI: An XAI Library for Tree-Based Models. IJCAI 2024: 8601-8605 - 2023
- [c10]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. AISTATS 2023: 4699-4711 - [c9]Gilles Audemard
, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
On Contrastive Explanations for Tree-Based Classifiers. ECAI 2023: 117-124 - [c8]Gilles Audemard, Steve Bellart, Louenas Bounia, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
PyXAI : calculer en Python des explications pour des modèles d'apprentissage supervisé. EGC 2023: 581-588 - 2022
- [i2]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. CoRR abs/2209.07740 (2022) - 2021
- [c7]Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan, Christophe Lecoutre, Lucien Mousin, Nadarajen Veerapen:
A hybrid CP/MOLS approach for multi-objective imbalanced classification. GECCO 2021: 723-731 - 2020
- [c6]Sara Tari, Nicolas Szczepanski, Lucien Mousin, Julie Jacques, Marie-Eléonore Kessaci, Laetitia Jourdan:
Multi-objective Automatic Algorithm Configuration for the Classification Problem of Imbalanced Data. CEC 2020: 1-8 - [c5]Nicolas Szczepanski, Lucien Mousin, Nadarajen Veerapen, Laetitia Jourdan:
Automatic Configuration of Multi-Thread Local Search: Preliminary Results on Bi-objective TSP. ICTAI 2020: 1241-1248 - [i1]Christophe Lecoutre, Nicolas Szczepanski:
PYCSP3: Modeling Combinatorial Constrained Problems in Python. CoRR abs/2009.00326 (2020)
2010 – 2019
- 2019
- [c4]Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski:
An Incremental SAT-Based Approach to the Graph Colouring Problem. CP 2019: 213-231 - 2018
- [c3]Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
DMC: A Distributed Model Counter. IJCAI 2018: 1331-1338 - 2017
- [b1]Nicolas Szczepanski:
SAT en Parallèle. (SAT Parallel Computing). Artois University, Arras, France, 2017 - [c2]Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
A Distributed Version of Syrup. SAT 2017: 215-232 - 2016
- [c1]Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
An Adaptive Parallel SAT Solver. CP 2016: 30-48
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-11-07 21:33 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:
