default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Prud'homme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Sulian Le Bozec-Chiffoleau, Charles Prud'homme, Gilles Simonin:
Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem. IJCAI 2024: 2860-2867- [c14]Jolan Philippe, Antoine Omond, Hélène Coullon, Charles Prud'homme, Issam Raïs:
Fast Choreography of Cross-DevOps Reconfiguration with Ballet: A Multi-Site OpenStack Case Study. SANER 2024: 1-11 - 2023
- [j7]Mathieu Vavrille, Charlotte Truchet, Charles Prud'homme:
Correction to: Solution sampling with random table constraints. Constraints An Int. J. 28(3): 519 (2023) - [c13]Gilles Audemard, Christophe Lecoutre, Charles Prud'homme
:
Guiding Backtrack Search by Tracking Variables During Constraint Propagation. CP 2023: 9:1-9:17 - [c12]Abdelghani Alidra, Hugo Bruneliere, Hélène Coullon, Thomas Ledoux, Charles Prud'homme, Jonathan Lejeune, Pierre Sens, Julien Sopena, Jonathan Rivalan:
SeMaFoR - Self-Management of Fog Resources with Collaborative Decentralized Controllers. SEAMS 2023: 25-31 - [i5]Stéphanie Delaune, Patrick Derbez, Arthur Gontier, Charles Prud'homme:
New Algorithm for Exhausting Optimal Permutations for Generalized Feistel Networks. IACR Cryptol. ePrint Arch. 2023: 23 (2023) - 2022
- [j6]Dimitri Justeau-Allaire, Charles Prud'homme:
Global domain views for expressive and cross-domain constraint programming. Constraints An Int. J. 27(1-2): 1-7 (2022) - [j5]Mathieu Vavrille, Charlotte Truchet, Charles Prud'homme:
Solution sampling with random table constraints. Constraints An Int. J. 27(4): 381-413 (2022) - [j4]Charles Prud'homme, Jean-Guillaume Fages:
Choco-solver: A Java library for constraint programming. J. Open Source Softw. 7(78): 4708 (2022) - [c11]Stéphanie Delaune, Patrick Derbez, Arthur Gontier, Charles Prud'homme:
New Algorithm for Exhausting Optimal Permutations for Generalized Feistel Networks. INDOCRYPT 2022: 103-124 - 2021
- [c10]Stéphanie Delaune, Patrick Derbez, Paul Huynh, Marine Minier, Victor Mollimard, Charles Prud'homme:
Efficient Methods to Search for Best Differential Characteristics on SKINNY. ACNS (2) 2021: 184-207 - [c9]Mathieu Vavrille, Charlotte Truchet, Charles Prud'homme:
Solution Sampling with Random Table Constraints. CP 2021: 56:1-56:17 - [c8]Stéphanie Delaune, Patrick Derbez, Arthur Gontier, Charles Prud'homme:
A Simpler Model for Recovering Superpoly on Trivium. SAC 2021: 266-285 - [i4]Stéphanie Delaune, Patrick Derbez, Arthur Gontier, Charles Prud'homme:
A Simpler Model for Recovering Superpoly onTrivium. IACR Cryptol. ePrint Arch. 2021: 1191 (2021) - 2020
- [i3]Stéphanie Delaune, Patrick Derbez, Paul Huynh, Marine Minier, Victor Mollimard, Charles Prud'homme:
SKINNY with Scalpel - Comparing Tools for Differential Analysis. IACR Cryptol. ePrint Arch. 2020: 1402 (2020)
2010 – 2019
- 2019
- [c7]Farah Aït-Salaht, Frédéric Desprez, Adrien Lebre, Charles Prud'homme, Mohamed Abderrahim:
Service Placement in Fog Computing Using Constraint Programming. SCC 2019: 19-27 - [c6]Mohamed Abderrahim, Meryem Ouzzif, Karine Guillouard, Jérôme François, Adrien Lebre, Charles Prud'homme, Xavier Lorca:
Efficient Resource Allocation for Multi-Tenant Monitoring of Edge Infrastructures. PDP 2019: 158-165 - 2018
- [j3]Zakarea Alshara, Frederico Alvares, Hugo Bruneliere, Jonathan Lejeune, Charles Prud'homme, Thomas Ledoux:
CoMe4ACloud: An end-to-end framework for autonomic Cloud systems. Future Gener. Comput. Syst. 86: 339-354 (2018) - 2017
- [c5]Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud'homme, Andreas Schutt, Peter J. Stuckey:
Range-Consistent Forbidden Regions of Allen's Relations. CPAIOR 2017: 21-29 - [c4]Jean-Guillaume Fages, Charles Prud'homme:
Making the First Solution Good! ICTAI 2017: 1073-1077 - 2016
- [c3]Xavier Lorca, Charles Prud'homme, Aurélien Questel, Benoît Rottembourg:
Using Constraint Programming for the Urban Transit Crew Rescheduling Problem. CP 2016: 636-649 - [i2]Charles Prud'homme, Xavier Lorca, Narendra Jussien:
Event Selection Rules to Compute Explanations. CoRR abs/1608.08015 (2016) - 2015
- [c2]Alban Derrien, Jean-Guillaume Fages, Thierry Petit, Charles Prud'homme:
A Global Constraint for a Tractable Class of Temporal Optimization Problems. CP 2015: 105-120 - [c1]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit, Charles Prud'homme:
A Modelling Pearl with Sortedness Constraints. GCAI 2015: 27-41 - 2014
- [b1]Charles Prud'homme:
Contrôle de la propagation et de la recherche dans un solveur de contraintes. (Controlling propagation and search within a constraint solver). École des mines de Nantes, France, 2014 - [j2]Charles Prud'homme, Xavier Lorca, Rémi Douence, Narendra Jussien:
Propagation engine prototyping with a domain specific language. Constraints An Int. J. 19(1): 57-76 (2014) - [j1]Charles Prud'homme, Xavier Lorca, Narendra Jussien:
Explanation-based large neighborhood search. Constraints An Int. J. 19(4): 339-379 (2014) - [i1]Jean-Guillaume Fages, Gilles Chabert, Charles Prud'homme:
Combining finite and continuous solvers. CoRR abs/1402.1361 (2014)
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:01 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:
