Conference
How to pay, come what may: Approximation algorithms for demand-robust covering problems
An edge in time saves nine: LP rounding approximation algorithms for stochastic network design
Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees