Demo Data from EDBT 2026 / reviewers in the wild / expert
Christophe Jermann
dblp:12/3363
· DBLP profile ↗
10ranked-venue papers
2as first author
0since 2021 · last 2016
0000-0002-1383-3103ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 2 first-authorSoftware engineering, systems software and programming languages · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorTheory of computation · 1
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
4 papers |
Mathematical optimization · 33% Computational geometry · 30% Computational complexity · 24% | |
| Artificial intelligence
2 papers |
Planning, search and constraint satisfaction · 100% | |
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 100% |
Topics — the 6 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction
symmetry breaking |
0.2 | 1 | 2015 | Variable symmetry breaking in numerical constraint problems · Artif. Intell. 2015 |
Mathematical optimization
branch-and-prune |
0.2 | 1 | 2014 | A branch and prune algorithm for the computation of generalized aspects of parallel robots · Artif. Intell. 2014 |
Computational complexity
constraint satisfaction |
0.2 | 1 | 2014 | A branch and prune algorithm for the computation of generalized aspects of parallel robots · Artif. Intell. 2014 |
Algorithms and data structures
anytime algorithms |
0.1 | 1 | 2009 | Search Strategies for an Anytime Usage of the Branch and Prune Algorithm · IJCAI 2009 |
Geometric modeling and processing
3d reconstruction |
0.0 | 1 | 2003 | Scene Modeling Based on Constraint System Decomposition Techniques · ICCV 2003 |
Geometric modeling and processing
3d scene modeling |
0.0 | 1 | 2003 | Scene Modeling Based on Constraint System Decomposition Techniques · ICCV 2003 |
Methods — techniques the papers use, named apart from their topics
branch-and-prune · 0.2interval analysis · 0.2search strategy · 0.1search strategies · 0.1r-methods · 0.0constraint system decomposition · 0.0GPDOF algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
Benjamin Martin 0003, Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann |
J. Glob. Optim. | 4 |
| 2015 | Variable symmetry breaking in numerical constraint problems
Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras |
Artif. Intell. | 2 |
| 2014 | A branch and prune algorithm for the computation of generalized aspects of parallel robots
Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann |
Artif. Intell. | 5 |
| 2013 | Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems
Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann |
CP | 3 |
| 2012 | A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots
Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann |
CP | 5 |
| 2011 | Symmetry Breaking in Numeric Constraint Problems
Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras |
CP | 2 |
| 2009 | Search Strategies for an Anytime Usage of the Branch and Prune Algorithm
Raphaël Chenouard, Alexandre Goldsztejn, Christophe Jermann |
IJCAI | 3 |
| 2003 | Scene Modeling Based on Constraint System Decomposition TechniquesabstractWe present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given constraints exactly. Our system can describe a large variety of linear and nonlinear constraints in a flexible way. To deal with the constraints, we decided to exploit the properties of the GPDOF algorithm developed in the Constraint Programming community (Trombettoni, 1998). The approach is based on a dictionary of so-called r-methods, based on theorems of geometry, which can solve a subset of geometric constraints in a very efficient way. GPDOF is used to find, in polynomial-time, a reduced parameterization of a scene, and to decompose the equation system, induced by constraints, into a sequence of r-methods. We have validated our approach in reconstructing, from images, 3D models of buildings based on linear and quadratic geometric constraints. Marta Wilczkowiak, Gilles Trombettoni, Christophe Jermann, Peter F. Sturm, Edmond Boyer |
ICCV | 3 |
| 2003 | Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
Christophe Jermann, Bertrand Neveu, Gilles Trombettoni |
IJCAI | 1 |
| 2000 | A Constraint Programming Approach for Solving Rigid Geometric Systems
Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, Michel Rueher |
CP | 1 |