default search action
Emmanuel Hebrard
Emmanuel Hébrard
Person information
- affiliation: LAAS-CNRS
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j17]Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Corrigendum to "Learning constraints through partial queries" [Artificial Intelligence 319 (2023) 103896]. Artif. Intell. 328: 104075 (2024) - [c65]Julien Rouzot, Joséphine Gobert, Christian Artigues, Romain Boyer, Frédéric Camps, Philippe Garnier, Emmanuel Hebrard, Pierre Lopez:
Scheduling Onboard Tasks of the NIMPH Nanosatellite. ICORES 2024: 277-284 - 2023
- [j16]Christian Bessiere
, Clément Carbonnel
Learning constraints through partial queries. Artif. Intell. 319: 103896 (2023) - [j15]Christian Bessiere
Complexity of minimum-size arc-inconsistency explanations. Constraints An Int. J. 28(3): 427-449 (2023) - [c64]Carla Juvin, Emmanuel Hebrard, Laurent Houssin
An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. CP 2023: 19:1-19:16 - [c63]Emir Demirovic, Emmanuel Hebrard, Louis Jean:
Blossom: an Anytime Algorithm for Computing Optimal Decision Trees. ICML 2023: 7533-7562 - 2022
- [j14]Emir Demirovic, Anna Lukina, Emmanuel Hebrard, Jeffrey Chan, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, Peter J. Stuckey:
MurTree: Optimal Decision Trees via Dynamic Programming and Search. J. Mach. Learn. Res. 23: 26:1-26:47 (2022) - [c62]Christian Bessiere, Clément Carbonnel, Martin C. Cooper
Complexity of Minimum-Size Arc-Inconsistency Explanations. CP 2022: 9:1-9:14 - [c61]Emmanuel Hebrard, Christian Artigues, Pierre Lopez, Arnaud Lusson, Steve A. Chien, Adrien Maillard, Gregg R. Rabideau:
An Efficient Approach to Data Transfer Scheduling for Long Range Space Exploration. IJCAI 2022: 4635-4641 - 2021
- [c60]Valentin Antuori, Tom Portoleau, Louis Rivière
On How Turing and Singleton Arc Consistency Broke the Enigma Code. CP 2021: 13:1-13:16 - [c59]Valentin Antuori, Emmanuel Hebrard
Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem. CP 2021: 14:1-14:16 - [c58]Christian Artigues, Emmanuel Hebrard, Alain Quilliot, Hélène Toussaint:
Multi-Mode RCPSP with Safety Margin Maximization: Models and Algorithms. ICORES 2021: 129-136 - 2020
- [j13]Emmanuel Hebrard
Introduction to the CPAIOR 2020 fast track issue. Constraints An Int. J. 25(3-4): 298-299 (2020) - [j12]Emmanuel Hebrard
Constraint and Satisfiability Reasoning for Graph Coloring. J. Artif. Intell. Res. 69: 33-65 (2020) - [c57]Arthur Godet, Xavier Lorca, Emmanuel Hebrard, Gilles Simonin
Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources. AAAI 2020: 1512-1519 - [c56]Valentin Antuori, Emmanuel Hebrard
Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing. CP 2020: 657-672 - [c55]Alexey Ignatiev, Martin C. Cooper
Towards Formal Fairness in Machine Learning. CP 2020: 846-867 - [c54]Hao Hu
Learning Optimal Decision Trees with MaxSAT and its Integration in AdaBoost. IJCAI 2020: 1170-1176 - [e1]Emmanuel Hebrard
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 17th International Conference, CPAIOR 2020, Vienna, Austria, September 21-24, 2020, Proceedings. Lecture Notes in Computer Science 12296, Springer 2020, ISBN 978-3-030-58941-7 [contents] - [i11]Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar
Partial Queries for Constraint Acquisition. CoRR abs/2003.06649 (2020) - [i10]Emir Demirovic, Anna Lukina, Emmanuel Hebrard, Jeffrey Chan, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, Peter J. Stuckey:
MurTree: Optimal Classification Trees via Dynamic Programming and Search. CoRR abs/2007.12652 (2020)
2010 – 2019
- 2019
- [c53]Emmanuel Hebrard
A Hybrid Approach for Exact Coloring of Massive Graphs. CPAIOR 2019: 374-390 - [c52]Alain Quilliot, Christian Artigues, Emmanuel Hebrard
Models and Algorithms for Natural Disaster Evacuation Problems. FedCSIS 2019: 143-146 - [c51]Emmanuel Hebrard
Clause Learning and New Bounds for Graph Coloring. IJCAI 2019: 6166-6170 - 2018
- [c50]Emmanuel Hebrard
Clause Learning and New Bounds for Graph Coloring. CP 2018: 179-194 - [c49]Emmanuel Hebrard
Conflict Directed Clause Learning for Maximum Weighted Clique Problem. IJCAI 2018: 1316-1323 - [c48]Emmanuel Hebrard
Reasoning about NP-complete Constraints. IJCAI 2018: 5672-5676 - [c47]Christian Artigues, Emmanuel Hébrard, Yannick Pencolé, Andreas Schutt, Peter J. Stuckey:
Data instance generator and optimization models for evacuation planning in the event of wildfire. RSFF 2018: 75-86 - 2017
- [j11]Emmanuel Hebrard
Constraint programming for planning test campaigns of communications satellites. Constraints An Int. J. 22(1): 73-89 (2017) - [c46]Emmanuel Hebrard
Explanation-Based Weighted Degree. CPAIOR 2017: 167-175 - [c45]Clément Carbonnel
On the Kernelization of Global Constraints. IJCAI 2017: 578-584 - [i9]Emmanuel Hébrard, Marie-José Huguet, Daniel Veysseire, Ludivine Boche Sauvan, Bertrand Cabon:
Constraint programming for planning test campaigns of communications satellites. CoRR abs/1701.06388 (2017) - [i8]Clément Carbonnel, Emmanuel Hébrard:
Propagation via Kernelization: The Vertex Cover Constraint. CoRR abs/1702.02470 (2017) - 2016
- [j10]Emmanuel Hebrard
Approximation of the parallel machine scheduling problem with additional unit resources. Discret. Appl. Math. 215: 126-135 (2016) - [c44]Clément Carbonnel
Propagation via Kernelization: The Vertex Cover Constraint. CP 2016: 147-156 - [c43]Christian Bessiere, Emmanuel Hebrard, George Katsirelos, Zeynep Kiziltan, Toby Walsh:
Ranking Constraints. IJCAI 2016: 705-711 - [p1]Christian Bessiere, Abderrazak Daoudi, Emmanuel Hebrard
New Approaches to Constraint Acquisition. Data Mining and Constraint Programming 2016: 51-76 - 2015
- [j9]Gilles Simonin
Scheduling scientific experiments for comet exploration. Constraints An Int. J. 20(1): 77-99 (2015) - [j8]Mohamed Siala
A study of constraint programming heuristics for the car-sequencing problem. Eng. Appl. Artif. Intell. 38: 34-44 (2015) - [j7]Diarmuid Grimes, Emmanuel Hebrard
Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search. INFORMS J. Comput. 27(2): 268-284 (2015) - [c42]Mohamed Siala
Two Clause Learning Approaches for Disjunctive Scheduling. CP 2015: 393-402 - [c41]Christian Bessiere, Emmanuel Hebrard, George Katsirelos, Toby Walsh:
Reasoning about Connectivity Constraints. IJCAI 2015: 2568-2574 - 2014
- [j6]Mohamed Siala
An optimal arc consistency algorithm for a particular case of sequence constraint. Constraints An Int. J. 19(1): 30-56 (2014) - [c40]Cédric Pralet, Gérard Verfaillie, Adrien Maillard, Emmanuel Hebrard, Nicolas Jozefowiez, Marie-José Huguet, Thierry Desmousceaux, Pierre Blanc-Paques, Jean Jaubert:
Satellite Data Download Management with Uncertainty about the Generated Volumes. ICAPS 2014 - [c39]Christian Bessiere, Emmanuel Hebrard
The Balance Constraint Family. CP 2014: 174-189 - [c38]Clément Carbonnel
On Backdoors to Tractable Constraint Languages. CP 2014: 224-239 - [c37]Christian Artigues, Emmanuel Hebrard
SAT and Hybrid Models of the Car Sequencing Problem. CPAIOR 2014: 268-283 - [c36]Christian Bessiere, Emmanuel Hebrard
Buffered Resource Constraint: Algorithms and Complexity. CPAIOR 2014: 318-333 - [c35]Christian Bessiere, Emmanuel Hebrard
Reasoning about Constraint Models. PRICAI 2014: 795-808 - [i7]Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon:
Soft Constraints of Difference and Equality. CoRR abs/1401.3879 (2014) - [i6]Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
On Backdoors To Tractable Constraint Languages. CoRR abs/1404.3675 (2014) - 2013
- [c34]Christian Bessiere, Clément Carbonnel, Emmanuel Hebrard, George Katsirelos, Toby Walsh:
Detecting and Exploiting Subproblem Tractability. IJCAI 2013: 468-474 - [c33]Christian Bessiere, Remi Coletta, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Constraint Acquisition via Partial Queries. IJCAI 2013: 475-481 - 2012
- [j5]Hadrien Cambazard, Emmanuel Hebrard
Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. 194(1): 111-135 (2012) - [c32]Gilles Simonin
Scheduling Scientific Experiments on the Rosetta/Philae Mission. CP 2012: 23-37 - [c31]Mohamed Siala
An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality. CP 2012: 55-69 - [c30]Jean-Charles Billaut, Emmanuel Hebrard
Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem. CPAIOR 2012: 66-80 - 2011
- [j4]Emmanuel Hebrard
Soft Constraints of Difference and Equality. J. Artif. Intell. Res. 41: 97-130 (2011) - [c29]Diarmuid Grimes, Emmanuel Hebrard
Models and Strategies for Variants of the Job Shop Scheduling Problem. CP 2011: 356-372 - [i5]Diarmuid Grimes, Emmanuel Hebrard:
Models and Strategies for Variants of the Job Shop Scheduling Problem. CoRR abs/1109.5920 (2011) - 2010
- [c28]Diarmuid Grimes, Emmanuel Hebrard
Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach. CPAIOR 2010: 147-161 - [c27]Emmanuel Hebrard
Constraint Programming and Combinatorial Optimisation in Numberjack. CPAIOR 2010: 181-185
2000 – 2009
- 2009
- [j3]Christian Bessiere, Emmanuel Hebrard
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints. Artif. Intell. 173(11): 1054-1078 (2009) - [c26]Christian Bessiere, Emmanuel Hebrard
Minimising Decision Tree Size as Combinatorial Optimisation. CP 2009: 173-187 - [c25]Diarmuid Grimes, Emmanuel Hebrard
Closing the Open Shop: Contradicting Conventional Wisdom. CP 2009: 400-408 - [c24]Emmanuel Hebrard
Constraints of Difference and Equality: A Complete Taxonomic Characterisation. CP 2009: 424-438 - [i4]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints. CoRR abs/0903.0211 (2009) - [i3]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
The Parameterized Complexity of Global Constraints. CoRR abs/0903.0467 (2009) - [i2]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
SLIDE: A Useful Special Case of the CARDPATH Constraint. CoRR abs/0903.0471 (2009) - [i1]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
The Complexity of Reasoning with Global Constraints. CoRR abs/0903.1139 (2009) - 2008
- [c23]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quimper, Toby Walsh:
The Parameterized Complexity of Global Constraints. AAAI 2008: 235-240 - [c22]Emmanuel Hebrard
A Soft Constraint of Equality: Complexity and Approximability. CP 2008: 358-371 - [c21]Christian Bessiere, Emmanuel Hebrard
SLIDE: A Useful Special Case of the CARDPATH Constraint. ECAI 2008: 475-479 - 2007
- [b1]Emmanuel Hebrard:
Robust solutions for constraint satisfaction and optimisation under uncertainty. University of New South Wales, Sydney, Australia, 2007 - [j2]Christian Bessiere, Emmanuel Hebrard
The Complexity of Reasoning with Global Constraints. Constraints An Int. J. 12(2): 239-259 (2007) - [c20]Emmanuel Hebrard, Barry O'Sullivan, Toby Walsh:
Distance Constraints in Constraint Satisfaction. IJCAI 2007: 106-111 - [c19]Christian Bessiere, Emmanuel Hebrard
Reformulating Global Constraints: The Slideand RegularConstraints. SARA 2007: 80-92 - 2006
- [j1]Christian Bessiere, Emmanuel Hebrard
Filtering Algorithms for the NValueConstraint. Constraints An Int. J. 11(4): 271-293 (2006) - [c18]Christian Bessiere, Emmanuel Hebrard
The ROOTS Constraint. CP 2006: 75-90 - [c17]Christian Bessiere, Emmanuel Hebrard
The Range Constraint: Algorithms and Implementation. CPAIOR 2006: 59-73 - 2005
- [c16]Emmanuel Hebrard, Brahim Hnich, Barry O'Sullivan, Toby Walsh:
Finding Diverse and Similar Solutions in Constraint Programming. AAAI 2005: 372-377 - [c15]Emmanuel Hebrard
Improved Algorithm for Finding (a, b)-Super Solutions. CP 2005: 848 - [c14]Emmanuel Hebrard
Computing Super-Schedules. CP 2005: 879-879 - [c13]Christian Bessiere, Emmanuel Hebrard
Filtering Algorithms for the NValue Constraint. CPAIOR 2005: 79-93 - [c12]Christian Bessiere, Emmanuel Hebrard
Among, Common and Disjoint Constraints. CSCLP 2005: 29-43 - [c11]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
The Range and Roots Constraints: Specifying Counting and Occurrence Problems. IJCAI 2005: 60-65 - 2004
- [c10]Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
The Complexity of Global Constraints. AAAI 2004: 112-117 - [c9]Emmanuel Hebrard:
Robust Solutions for Constraint Satisfaction and Optimization. AAAI 2004: 952-953 - [c8]Emmanuel Hebrard:
Super Solutions in Constraint Programming. IJCAR Doctoral Programme 2004 - [c7]Christian Bessiere, Emmanuel Hebrard
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables. CP 2004: 138-152 - [c6]Christian Bessiere, Emmanuel Hebrard
The Tractability of Global Constraints. CP 2004: 716-720 - [c5]Emmanuel Hebrard
Extending Super-solutions. CP 2004: 798 - [c4]Emmanuel Hebrard
Super Solutions in Constraint Programming. CPAIOR 2004: 157-172 - [c3]Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
Robust Solutions for Constraint Satisfaction and Optimization. ECAI 2004: 186-190 - 2003
- [c2]Emmanuel Hebrard
Solution Stability in Constraint Satisfaction Problems. CP 2003: 974 - [c1]Christian Bessière, Emmanuel Hebrard
Local Consistencies in SAT. SAT 2003: 299-314
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-10-07 22:19 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: