Olivier Lhomme

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:43/2508 · DBLP profile ↗

← Back

9ranked-venue papers

5as first author

0since 2021 · last 2006

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 2 papers		Computational complexity · 67% Algorithms and data structures · 33%
Artificial intelligence 3 papers		Planning, search and constraint satisfaction · 74% Probabilistic and Bayesian machine learning · 26%

Topics — the 7 heaviest of 9, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Computational complexity › constraint satisfaction › constraint propagation arc consistency	0.1	1	2005	A Fast Arc Consistency Algorithm for n-ary Constraints · AAAI 2005
Computational complexity constraint satisfaction	0.1	1	2005	A Fast Arc Consistency Algorithm for n-ary Constraints · AAAI 2005
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint programming Numeric CSP	0.0	2	2002	Accelerating filtering techniques for numeric CSPs · Artif. Intell. 2002 Consistency Techniques for Numeric CSPs · IJCAI 1993
Machine learning › Probabilistic and Bayesian machine learning data filtering	0.0	1	2002	Accelerating filtering techniques for numeric CSPs · Artif. Intell. 2002
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search local search	0.0	1	2002	Local search with constraint propagation and conflict-based heuristics · Artif. Intell. 2002
Knowledge, reasoning and agents › Planning, search and constraint satisfaction constraint propagation	0.0	1	2002	Local search with constraint propagation and conflict-based heuristics · Artif. Intell. 2002
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › local consistency local consistency algorithms	0.0	1	1993	Consistency Techniques for Numeric CSPs · IJCAI 1993

Methods — techniques the papers use, named apart from their topics

constraint propagation · 0.1filtering algorithm · 0.0conflict-based heuristics · 0.0

Year	Publication	Venue	Position
2006	Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis Ulrich Junker, Olivier Lhomme	ECAI	2
2005	Quick Shaving Olivier Lhomme	AAAI	1
2005	A Fast Arc Consistency Algorithm for n-ary Constraints Olivier Lhomme, Jean-Charles Régin	AAAI	1
2004	Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints Olivier Lhomme	CPAIOR	1
2003	An Efficient Filtering Algorithm for Disjunction of Constraints Olivier Lhomme	CP	1
2002	Local search with constraint propagation and conflict-based heuristics Narendra Jussien, Olivier Lhomme	Artif. Intell.	2
2002	Accelerating filtering techniques for numeric CSPs Yahia Lebbah, Olivier Lhomme	Artif. Intell.	2
1998	Dynamic Domain Splitting for Numeric CSPs Narendra Jussien, Olivier Lhomme	ECAI	2
1993	Consistency Techniques for Numeric CSPs Olivier Lhomme	IJCAI	1