Daniel Dadush

Daniel Dadush is a part-time Professor of Geometry of Optimization at Utrecht University and leads the Networks & Optimization group at Centrum Wiskunde & Informatica (CWI). He has held previous positions as a Simons Postdoctoral Fellow at the Courant Institute of Mathematical Sciences (New York University) and a PhD in the ACO program (Algorithms, Combinatorics, and Optimization) at Georgia Tech.

• Research Interests: Lattice Algorithms, Geometry of Numbers, Linear/Integer Programming, Extended Formulations, Discrepancy Theory, Convex Optimization, Asymptotic Convex Geometry.
• Awards: Van Dantzig Prize (2020), Best Paper Award at CCC'20 (2020), Tucker Prize (2015).
• Advising: Supervised PhD/MSc students including Ben Bals, Samarth Tiwari, Sander Borst, Sophie Huiberts, Huck Bennett, and Yilin Li.
• Recent Publications: His 15 most recent articles focus on strongly polynomial algorithms, exact integer programming, convex optimization in the oracle model, matrix discrepancy, circuit diameter bounds, and integrality gaps, spanning journals and conferences like STOC, SODA, FOCS, and Mathematical Programming.
• Professional Activities: Organizer of the Dutch Day on Optimization (2022), co-organizer of workshops on Discrepancy Theory, Lattices, and Discrete Optimization at institutions like HIM Bonn and the Simons Institute. Served on program committees for STOC 2025, SODA 2024, and other major conferences.
• Teaching: Lectured on Interior Point Methods, Straight-Line Complexity, and courses in Continuous Optimization at Utrecht University and Mastermath.