Defense of Diane Puges
On June 17, 2025, Diane Puges completed her doctoral studies with her defense. In her presentation, “From Linear Orderings to Infinite Trees: Semidefinite Programming for Combinatorial Optimization and Extremal Combinatorics,” she presented her work applying semidefinite methods in a wide range of polynomial optimization applications.











