| No. |
Title |
Author |
Year |
| 1 |
Submodular Norms with Applications To Online Facility Location and Stochastic Probing |
Patton, Kalen et al. |
2023 |
| 2 |
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing |
Bansal, Nikhil et al. |
2022 |
| 3 |
Smoothed Analysis of the Komlós Conjecture |
Bansal, Nikhil et al. |
2022 |
| 4 |
Submodular Dominance and Applications |
Qiu, Frederick et al. |
2022 |
| 5 |
Bag-Of-Tasks Scheduling on Related Machines |
Gupta, Anupam et al. |
2021 |
| 6 |
Algorithms and Adaptivity Gaps for Stochastic k-TSP |
Jiang, Haotian et al. |
2020 |
| 7 |
Online Carpooling Using Expander Decompositions |
Gupta, Anupam et al. |
2020 |
| 8 |
Robust Algorithms for the Secretary Problem |
Bradac, Domagoj et al. |
2020 |
| 9 |
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing |
Bradac, Domagoj et al. |
2019 |
| 10 |
Non-Clairvoyant Precedence Constrained Scheduling |
Garg, Naveen et al. |
2019 |
| 11 |
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty |
Hershkowitz, David Ellis et al. |
2019 |
| 12 |
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities |
Lee, Euiwoong et al. |
2018 |
