معرفی
Florent Foucaud is an Associate Professor at Université Clermont Auvergne, affiliated with the Computer Science department of IUT Clermont Auvergne. He conducts research at the LIMOS laboratory within the MAAD research axis and AlCoLoCo working group.
His research focuses on graph algorithms and graph theory, particularly identifying codes, metric dimension, graph homomorphisms, and metric-based covering/packing problems. His work addresses both structural properties and algorithmic complexity of these problems.
Key trends in his recent publications include parameterized complexity for graph identification problems, extremal graph analysis, and algorithm design for domination, metric dimension, and geodetic sets in restricted graph classes like trees, bipartite graphs, and chordal graphs.
He has collaborated with researchers across France (LaBRI, LIFO, LAMSADE), Spain (UPC), South Africa (University of Johannesburg), and India (IIT Kharagpur). His work has been supported by ANR grants HOSIGRA (signed graph homomorphisms) and IDEA (identifying codes).
