{{page>inc&noheader&nofooter}}

=== News ===

Dec 16, 2019 Conference: [[https://www.irif.fr/rencontres/irif/algo2019|Autour des Algorithmes]]

=== Bref CV ===

Claire Mathieu fait de la recherche sur la conception et l'analyse d'algorithmes. Son domaine de spécialité concerne les algorithmes approchés pour des problèmes d'optimisation combinatoire. Elle est directrice de recherche au CNRS en informatique. Elle a occupé la chaire Informatique et sciences numériques du Collège de France en 2017-2018, a participé à la conception des algorithmes de Parcoursup, a reçu la médaille d'argent 2019 du CNRS, et est membre de l'Académie des Sciences.

Claire Mathieu's research area concerns the design and analysis of algorithms, particularly the design of approximation algorithms for combinatorial optimization. She is a research director in Computer Science at CNRS. She was a recipient of the Computer Science Chair at College de France, participated in the design of the French Parcoursup platform for college admissions, received the 2019 CNRS Silver Medal, and belongs to the French Academy of Science.


=== The basics ===

Claire Mathieu, CNRS\\ 
Address: IRIF, Office 4009, 4th floor of Bâtiment Sophie Germain,\\ 
8 place Aurélie Nemours, Paris (13th arrondissement).\\ 
Email: Claire.Mathieu@irif.fr\\ 

{{ :users:claire:cv-complet-mathieu-2018.pdf |Long Curriculum Vitae }} (Updated 2018; Addendum : CNRS Silver medal 2019)\\ 
{{ :users:claire:cv-1page-Mathieu-2019.pdf |Short Curriculum Vitae }} (Updated 2019)\\ 
{{ :users:claire:cv-bref-francais-mathieu-2020.pdf |CV bref, in French}} (Updated 2020)\\

Publication list on [[https://dblp.uni-trier.de/pers/hd/m/Mathieu:Claire|DBLP]]

=== Some recent papers ===

  * [[https://arxiv.org/abs/1811.01537|How to aggregate Top-lists: Score based approximation schemes]] (SODA 2020)\\ 
  * [[https://arxiv.org/abs/1806.08182|Instance-Optimality in the Noisy Value-and Comparison-Model]] (SODA 2020)\\ 
  * [[https://www.di.ens.fr/~mmari/content/papers/MACS.pdf|Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint]] (APPROX 2019)\\ 
  * [[https://groups.csail.mit.edu/tds/papers/Mallmann-Trenn/SODA18.pdf|Hierarchical Clustering: Objective Functions and Algorithms]] (SODA 2018; JACM, accepted).{{ :users:claire:talkcolle_gedefrance7juin2018.pdf |Slides}}\\ 
  * [[http://drops.dagstuhl.de/opus/volltexte/2018/10021/pdf/LIPIcs-ISAAC-2018-73.pdf|Covering Clients with Types and Budgets]] (ISAAC 2018)\\ 
  * [[https://hal.archives-ouvertes.fr/hal-01740357/document|Combinatorics of Local Search: An Optimal 4-Local Hall’s Theorem for Planar Graphs]] (ESA 2017)\\ 
  * [[https://arxiv.org/abs/1707.02577|Dynamic clustering to minimize the sum of radii]] (ESA 2017)\\ 
  * [[https://arxiv.org/abs/1608.04535|Optimization of Bootstrapping in Circuits]] (SODA 2017)\\ 
  * [[https://arxiv.org/abs/1603.09535|Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics]] (FOCS 2016) {{ :users:claire:berlin-talk-june-2017.pdf |Slides}}\\ 
  * [[https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch109|Distance in the Forest Fire Model How far are you from Eve?]] (2016){{ :users:claire:paris-descartes.pdf |Slides}}\\ 
  * {{ :users:claire:glassceilingpaper.pdf |Homophily and the Glass Ceiling Effect in Social Networks}}(2015) {{ :users:claire:claire_glass_final.pdf |Slides}}

=== Broader Impact ===

  * [[https://books.openedition.org/cdf/5609|L'algorithmique]] (livre)\\ 
  * {{ :users:claire:pif16-claire-nob2018.pdf | Algorithmes et nature}} (PIF, Novembre 2018)\\ 
  * {{ :users:claire:forumcnrs.pdf | Algorithmes et bien commun}} (Forum CNRS, Novembre 2017)\\ 
  * {{ :users:claire:presentation_algorithmes_parcoursup.pdf | Algorithmes de Parcoursup}} (mai 2018)\\ 
  * {{ :users:claire:nice-2018-collegeadmissions.pdf | Slides from a talk about Parcoursup}}\\ 
  * [[http://binaire.blog.lemonde.fr/2018/06/05/la-transparence-a-lecole-de-parcoursup/|La transparence à l’école de Parcoursup]]

=== Photos ===

Photos libres de droit (les deux premieres ont ete prises par Patrick Imbert, photographe au Collège de France):\\

{{:users:claire:ClaireMathieucdf1.jpg?400}} {{:users:claire:ClaireMathieucdf2.jpg?400}}