Mathematics
Discrete geometry, lattices and polyhedra: problems where the structure has to be understood before anything can be computed.
- PhD in mathematics (Université Paris-Sud, 1999), agrégation, École Normale Supérieure
- Lattices and quadratic forms: perfect forms, Voronoi and Delaunay tessellations, packing and covering
- Polytopes and their symmetries: dual description, cut and metric polytopes, representation conversion up to symmetry
- Graphs and maps: fullerenes, polycycles, zigzags, embeddings
- Group cohomology of arithmetic groups, and computational input for algebraic geometry (moduli spaces, compactifications)
- Linear, integer, semidefinite and copositive programming; SAT and SMT