Publications

1. An unconditional lower bound for the active-set method in convex quadratic maximization
   with Eleon Bach, Yann Disser, Nils Mosis.
   
2. Optimal Smoothed Analysis of the Simplex Method
   with Eleon Bach.
   to appear in FOCS 2025.
3. Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
   with Xinzhi Zhang, Yin Tat Lee.
   STOC 2023. Recorded talk.
4. A Nearly Optimal Randomized Algorithm for Explorable Heap Selection
   with Sander Borst, Daniel Dadush, Danish Kashaev.
   IPCO 2023, Mathematical Programming. Recorded talk.
5. A Simple Method for Convex Optimization in the Oracle Model
   with Daniel Dadush, Christopher Hojny, Stefan Weltge.
   IPCO 2022, Mathematical Programming. Recorded talk.
6. Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes
   with Gilles Bonnet, Daniel Dadush, Uri Grupel, Galyna Livshyts.
   SOCG 2022, to appear in Discrete and Computational Geometry. Recorded talk.
7. On the Integrality Gap of Binary Integer Programs with Gaussian Data
   with Sander Borst, Daniel Dadush, Samarth Tiwari.
   IPCO 2021, Mathematical Programming.
8. A Scaling-Invariant Algorithm for Linear Programming Whose Running Time Depends Only on the Constraint Matrix
   with Daniel Dadush, Bento Natura, László Végh.
   STOC 2020, Mathematical Programming. Recorded talk.
9. A Friendly Smoothed Analysis of the Simplex Method
   with Daniel Dadush.
   STOC 2018, SIAM Journal on Computing. Recorded talk.

Chapters

1. Smoothed Analysis of the Simplex Method
   with Daniel Dadush.
   Book chapter in Beyond the Worst-Case Analysis of Algorithms, ed. Tim Roughgarden, 2021.

Theses

1. Geometric Aspects of Linear Programming: Shadow Paths, Central Paths, and a Cutting Plane Method
   Stieltjes Prize for best Dutch PhD thesis in mathematics. Gijs de Leve Prize for best Dutch PhD thesis in operations research.
2. How Large is the Shadow? Smoothed Analysis of the Simplex Method
   Thesis for the master’s programme Mathematical Sciences at Utrecht University. Finalist (top 3) for Faculty of Science master thesis prize.

Miscellaneous

1. Het Dieetprobleem
   STAtOR, July 2025. Recorded talk
2. Prizes and Prejudice
   Bulletin of the EATCS, 2022.
3. Wanneer is software snel?
   AG Connect, 2021.

Collaborators

Thanks to all my collaborators with Eleon Bach, Gilles Bonnet, Sander Borst, Daniel Dadush, Yann Disser, Uri Grupel, Christopher Hojny, Danish Kashaev, Yin Tat Lee, Galyna Livshyts, Nils Mosis, Bento Natura, Samarth Tiwari, László Végh, Stefan Weltge, Xinzhi Zhang,