Jean-Christophe Janodet

Informatique, Biologie Intégrative et Systèmes Complexes

Papers

Total Citations

H-Index

About

Jean-Christophe Janodet is a leading figure in computational geometry and graph theory, whose work bridges the gap between theoretical computer science and practical pattern recognition. His research focuses on the development of polynomial-time algorithms for graph and subgraph isomorphism problems, particularly in the context of open plane graphs—a class of graphs embedded in the plane that are crucial for applications in image analysis, document processing, and structural pattern recognition. His most-cited paper, "Polynomial algorithms for open plane graph and subgraph isomorphisms" (2013, 14 citations), introduces efficient methods for matching such graphs, offering a significant advance over the general NP-hardness of graph isomorphism. This contribution has enabled more robust and scalable solutions in fields like handwriting recognition and map matching. Beyond this landmark work, Janodet has explored graph-based representations for complex data structures, contributing to the development of algorithms that are both theoretically sound and practically viable. His work is widely cited by researchers in pattern recognition and computer vision, underscoring its lasting impact on the design of efficient graph-matching techniques.