Claire Mathieu
Professor
Computer Science Department
Ecole Normale Superieure (ENS)
France
Biography
Since May 2012, research director at CNRS (National Center for Scientific Research) in Paris, France. In 2017-18, professor at the Collège de France on the annual Chair "Computer Science and Digital Sciences". In 2017-18, visiting IRIF (Paris-Diderot University).
Research Interest
Claire Mathieu works on algorithms, particularly the design of approximation schemes for NP-hard combinatorial optimization problems. She is employed by CNRS (Centre National de la Recherche Scientifique) in Paris, France. Her current research interests include approximation algorithms for planar graphs and for Euclidean problems; probabilistic models for social networks; hierarchies of semi-definite programming relaxations; network tomography; scheduling to minimize energy; online algorithms; computing with noisy information; facility location and clustering; and occasional forays into algorithmic game theory.
Publications
-
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou: Optimization of Bootstrapping in Circuits. SODA 2017: 2423-2433
-
Monika Henzinger, Dariusz Leniowski, Claire Mathieu: Dynamic Clustering to Minimize the Sum of Radii. ESA 2017: 48:1-48:10
-
Daniel Antunes, Claire Mathieu, Nabil H. Mustafa: Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. ESA 2017: 8:1-8:13
