| No. |
Title |
Author |
Year |
| 1 |
Robust Algorithms for the Secretary Problem |
Bradac, Domagoj et al. |
2020 |
| 2 |
Non-Clairvoyant Precedence Constrained Scheduling |
Garg, Naveen et al. |
2019 |
| 3 |
Stochastic Online Metric Matching |
Gupta, Anupam et al. |
2019 |
| 4 |
Tight FPT Approximations for k-Median and k-Means |
Cohen-Addad, Vincent et al. |
2019 |
| 5 |
A Local-Search Algorithm for Steiner Forest |
Groß, Martin et al. |
2018 |
| 6 |
Fully-Dynamic Bin Packing with Little Repacking |
Feldkord, Björn et al. |
2018 |
| 7 |
Maximizing Profit with Convex Costs in the Random-order Model |
Gupta, Anupam et al. |
2018 |
| 8 |
Non-Preemptive Flow-Time Minimization via Rejections |
Gupta, Anupam et al. |
2018 |
| 9 |
Stochastic Unsplittable Flows |
Gupta, Anupam et al. |
2017 |
| 10 |
Approximation Algorithms for Aversion k-Clustering via Local k-Median |
Gupta, Anupam et al. |
2016 |
| 11 |
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs |
Bansal, Nikhil et al. |
2015 |
| 12 |
10211 Abstracts Collection -- Flexible Network Design |
Gupta, Anupam et al. |
2010 |
| 13 |
Differentially Private Combinatorial Optimization |
Talwar, Kunal et al. |
2010 |
| 14 |
All-Norms and All-L_p-Norms Approximation Algorithms |
Golovin, Daniel et al. |
2008 |
