 | 2012 |
| 40 |  | Jean-Charles Billaut,
Emmanuel Hebrard,
Pierre Lopez:
Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem.
CPAIOR 2012: 66-80 |
| 39 |  | Hadrien Cambazard,
Emmanuel Hebrard,
Barry O'Sullivan,
Alexandre Papadopoulos:
Local search and constraint programming for the post enrolment-based course timetabling problem.
Annals OR 194(1): 111-135 (2012) |
| 2011 |
| 38 |  | Diarmuid Grimes,
Emmanuel Hebrard:
Models and Strategies for Variants of the Job Shop Scheduling Problem.
CP 2011: 356-372 |
| 37 |  | Diarmuid Grimes,
Emmanuel Hebrard:
Models and Strategies for Variants of the Job Shop Scheduling Problem
CoRR abs/1109.5920: (2011) |
| 36 |  | Emmanuel Hebrard,
Dániel Marx,
Barry O'Sullivan,
Igor Razgon:
Soft Constraints of Difference and Equality.
J. Artif. Intell. Res. (JAIR) 41: 97-130 (2011) |
| 2010 |
| 35 |  | Diarmuid Grimes,
Emmanuel Hebrard:
Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach.
CPAIOR 2010: 147-161 |
| 34 |  | Emmanuel Hebrard,
Eoin O'Mahony,
Barry O'Sullivan:
Constraint Programming and Combinatorial Optimisation in Numberjack.
CPAIOR 2010: 181-185 |
| 2009 |
| 33 |  | Christian Bessiere,
Emmanuel Hebrard,
Barry O'Sullivan:
Minimising Decision Tree Size as Combinatorial Optimisation.
CP 2009: 173-187 |
| 32 |  | Diarmuid Grimes,
Emmanuel Hebrard,
Arnaud Malapert:
Closing the Open Shop: Contradicting Conventional Wisdom.
CP 2009: 400-408 |
| 31 |  | Emmanuel Hebrard,
Dániel Marx,
Barry O'Sullivan,
Igor Razgon:
Constraints of Difference and Equality: A Complete Taxonomic Characterisation.
CP 2009: 424-438 |
| 30 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints.
Artif. Intell. 173(11): 1054-1078 (2009) |
| 29 |  | 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) |
| 28 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The Parameterized Complexity of Global Constraints
CoRR abs/0903.0467: (2009) |
| 27 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
SLIDE: A Useful Special Case of the CARDPATH Constraint
CoRR abs/0903.0471: (2009) |
| 26 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Complexity of Reasoning with Global Constraints
CoRR abs/0903.1139: (2009) |
| 2008 |
| 25 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Claude-Guy Quimper,
Toby Walsh:
The Parameterized Complexity of Global Constraints.
AAAI 2008: 235-240 |
| 24 |  | Emmanuel Hebrard,
Barry O'Sullivan,
Igor Razgon:
A Soft Constraint of Equality: Complexity and Approximability.
CP 2008: 358-371 |
| 23 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
SLIDE: A Useful Special Case of the CARDPATH Constraint.
ECAI 2008: 475-479 |
| 2007 |
| 22 |  | Emmanuel Hebrard,
Barry O'Sullivan,
Toby Walsh:
Distance Constraints in Constraint Satisfaction.
IJCAI 2007: 106-111 |
| 21 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Claude-Guy Quimper,
Toby Walsh:
Reformulating Global Constraints: The Slideand RegularConstraints.
SARA 2007: 80-92 |
| 20 |  | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Complexity of Reasoning with Global Constraints.
Constraints 12(2): 239-259 (2007) |
| 2006 |
| 19 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The ROOTS Constraint.
CP 2006: 75-90 |
| 18 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The Range Constraint: Algorithms and Implementation.
CPAIOR 2006: 59-73 |
| 17 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Filtering Algorithms for the NValueConstraint.
Constraints 11(4): 271-293 (2006) |
| 2005 |
| 16 |  | Emmanuel Hebrard,
Brahim Hnich,
Barry O'Sullivan,
Toby Walsh:
Finding Diverse and Similar Solutions in Constraint Programming.
AAAI 2005: 372-377 |
| 15 |  | Emmanuel Hebrard,
Toby Walsh:
Improved Algorithm for Finding (a, b)-Super Solutions.
CP 2005: 848 |
| 14 |  | Emmanuel Hebrard,
Paul Tyler,
Toby Walsh:
Computing Super-Schedules.
CP 2005: 879-879 |
| 13 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Filtering Algorithms for the NValue Constraint.
CPAIOR 2005: 79-93 |
| 12 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Among, Common and Disjoint Constraints.
CSCLP 2005: 29-43 |
| 11 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The Range and Roots Constraints: Specifying Counting and Occurrence Problems.
IJCAI 2005: 60-65 |
| 2004 |
| 10 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Complexity of Global Constraints.
AAAI 2004: 112-117 |
| 9 |  | Emmanuel Hebrard:
Robust Solutions for Constraint Satisfaction and Optimization.
AAAI 2004: 952-953 |
| 8 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables.
CP 2004: 138-152 |
| 7 |  | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Tractability of Global Constraints.
CP 2004: 716-720 |
| 6 |  | Emmanuel Hebrard:
Extending Super-solutions.
CP 2004: 798 |
| 5 |  | Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
Super Solutions in Constraint Programming.
CPAIOR 2004: 157-172 |
| 4 |  | Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
Robust Solutions for Constraint Satisfaction and Optimization.
ECAI 2004: 186-190 |
| 3 |  | Emmanuel Hebrard:
Super Solutions in Constraint Programming.
IJCAR Doctoral Programme 2004 |
| 2003 |
| 2 |  | Emmanuel Hebrard:
Solution Stability in Constraint Satisfaction Problems.
CP 2003: 974 |
| 1 |  | Christian Bessière,
Emmanuel Hebrard,
Toby Walsh:
Local Consistencies in SAT.
SAT 2003: 299-314 |