معرفی
Antoine Dailly is a Research Fellow at INRAE within the TSCF research unit. Previously, he held postdoctoral positions at LIMOS (2022–2024) under Florent Foucaud, UNAM Juriquilla (2019–2021), and teaching roles (ATER) at IUT2 Grenoble (2021–2022) and University of Grenoble Alpes (2018–2019). He completed his PhD at Université Claude Bernard Lyon 1 (2015–2018) in the LIRIS laboratory.
Research Focus: Dailly specializes in graph algorithms, combinatorial optimization, and sensor networks. His work includes:
- Algorithmic approaches to metric problems in graphs, uncertainty representation, and autonomous agent trajectory optimization.
- Combinatorial games, graph criticality, and structural/algorithmic challenges in vertex deletion, coloring, and equilibrability.
- Current projects: ANR GRALMECO (metric covering in graphs) and ConnecSenS (sensor networks).
Publication Trends: His 15 most recent articles (2017–2025) primarily explore combinatorics, discrete mathematics, and algorithmic theory. Key themes include:
- Planar graphs, geodetic games, and temporal graph resolving sets.
- Complexity of Arc-Kayles, path covers in DAGs, and digraph metric dimensions.
- Applications in game theory, optimization, and information theory.
Teaching & Outreach: Dailly has taught algorithms, programming (C/Python/XML), and graph theory at ISIMA, IUT, UNAM, and Grenoble. He co-leads the ISO group, promoting computer science education without computers.
Affiliations: Member of AlCoLoCo (algorithmic research group) and labs including G-SCOP, LIRIS, and LIMOS.
