Emmanuel Hebrard
13 papers · 2013–2023 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
π Conference Polyglot (4) π§ Keyword Pioneer π£ Hot Topic Early Bird π Interdisciplinary Bridge π Academic Marathon (10)
π
Academic Marathon
(10)
π
Cross-Pollinator
(7)
π
Renaissance Researcher
(5)
π§¬
Topic Evolution
π
Century Club
(13)
π
Conference Pioneer
π₯
Unstoppable
(6)
Conferences
IJCAI (10)
AAAI (1)
ICML (1)
JMLR (1)
Top co-authors
Keywords
constraint programming
(4)
optimal decision tree
(2)
combinatorial optimization
(2)
decision tree
(2)
dynamic programming
(2)
graph coloring
(1)
constraint propagation
(1)
branch and bound
(1)
lower bound
(1)
maxsat solving
(1)
anytime algorithm
(1)
interpretable model
(1)
sat solver
(1)
approximation algorithm
(1)
conflict-driven clause learning
(1)
parameterized complexity
(1)
parallel machine scheduling
(1)
branch and bound search
(1)
vertex cover
(1)
constraint satisfaction
(1)
Papers
Blossom: an Anytime Algorithm for Computing Optimal Decision Trees
ICML 2023
An Efficient Approach to Data Transfer Scheduling for Long Range Space Exploration
IJCAI 2022
MurTree: Optimal Decision Trees via Dynamic Programming and Search
JMLR 2022
Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources
AAAI 2020
Learning Optimal Decision Trees with MaxSAT and its Integration in AdaBoost
IJCAI 2020
Clause Learning and New Bounds for Graph Coloring
IJCAI 2019
Conflict Directed Clause Learning for Maximum Weighted Clique Problem
IJCAI 2018
Reasoning about NP-complete Constraints
IJCAI 2018
On the Kernelization of Global Constraints
IJCAI 2017
Ranking Constraints
IJCAI 2016
Reasoning about Connectivity Constraints
IJCAI 2015
Detecting and Exploiting Subproblem Tractability
IJCAI 2013
Constraint Acquisition via Partial Queries
IJCAI 2013