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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

André Cérézo

dblp:14/2992 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1996
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
1 paper
Motion planning and robot control · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning › smooth path planning
curvature-constrained shortest path		 0.011992
Shortest paths of bounded curvature in the plane · ICRA 1992
Robotics › Motion planning and robot control
motion planning		 0.011992
Shortest paths of bounded curvature in the plane · ICRA 1992
Graph algorithms and graph theory
shortest path		 0.011992
Shortest paths of bounded curvature in the plane · ICRA 1992

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

pontryagin minimum principle · 0.0
YearPublicationVenuePosition
1996 An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D
Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec
 Comput. Geom.2
1992 Shortest paths of bounded curvature in the plane
abstract
Given two oriented points in the plane, the authors determine and compute the shortest paths of bounded curvature joining them. This problem has been solved by L.E. Dubins (1957) in the no-cusp case, and by J.A. Reeds and L.A. Shepp (1990) with cusps. A solution based on the minimum principle of Pontryagin is proposed. The approach simplifies the proofs and makes clear the global or local nature of the results. The no-cusp case and the more difficult case with cusps are discussed.>
Jean-Daniel Boissonnat, André Cérézo, Juliette Leblond
 ICRA2