Improved approximation for tree augmentation: saving by rewiring.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Applications of Strong Convex Relaxations to Allocation Problems.
PhD thesis, 2017
Combinatorial Algorithm for Restricted Max-Min Fair Allocation.
ACM Trans. Algorithms, 2017
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Space lower bounds for low-stretch greedy embeddings.
Theor. Comput. Sci., 2016
An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
On the configuration LP for maximum budgeted allocation.
Math. Program., 2015
Enforcing Efficient Equilibria in Network Design Games via Subsidies.
Algorithmica, 2015