| No. |
Title |
Author |
Year |
| 1 |
Cardinality Constrained Scheduling in Online Models |
Epstein, Leah et al. |
2022 |
| 2 |
Additive Approximation Schemes for Load Balancing Problems |
Buchem, Moritz et al. |
2021 |
| 3 |
Knapsack and Subset Sum with Small Items |
Polak, Adam et al. |
2021 |
| 4 |
The Submodular Santa Claus Problem in the Restricted Assignment Case |
Bamas, Etienne et al. |
2021 |
| 5 |
Robust Algorithms Under Adversarial Injections |
Garg, Paritosh et al. |
2020 |
| 6 |
Local Search Breaks 1.75 for Graph Balancing |
Jansen, Klaus et al. |
2019 |
| 7 |
Near-Linear Time Algorithm for n-fold ILPs via Color Coding |
Jansen, Klaus et al. |
2019 |
| 8 |
Online Bin Covering with Limited Migration |
Berndt, Sebastian et al. |
2019 |
| 9 |
Compact LP Relaxations for Allocation Problems |
Jansen, Klaus et al. |
2018 |
| 10 |
On Integer Programming and Convolution |
Jansen, Klaus et al. |
2018 |
