Guillaume Damiand

Papers

Total Citations

H-Index

About

Guillaume Damiand is a leading researcher in combinatorial topology and computational geometry, with a focus on the design and analysis of algorithms for graph and map representations. His major contributions center on developing efficient polynomial-time algorithms for subgraph isomorphism problems in planar and open plane graphs—structures critical for modeling spatial relationships in computer graphics, geographic information systems, and image analysis. Notably, his 2013 work "Polynomial algorithms for open plane graph and subgraph isomorphisms" (14 citations) provides foundational methods for matching and comparing planar subdivisions, enabling robust shape recognition and topological data analysis. Damiand’s research bridges theoretical computer science and practical applications, offering tools that reduce exponential complexity to tractable solutions for real-world geometric data. His impact extends through collaborations on combinatorial map data structures, which underpin modern frameworks for representing 2D and 3D objects. For students and researchers, Damiand’s work exemplifies how deep theoretical insights into graph isomorphism can unlock scalable approaches to complex spatial problems, making him a key figure in advancing computational topology.