| No. |
Title |
Author |
Year |
| 1 |
Cardinality Constrained Scheduling in Online Models |
Epstein, Leah et al. |
2022 |
| 2 |
Truly Asymptotic Lower Bounds for Online Vector Bin Packing |
Balogh, János et al. |
2021 |
| 3 |
Online Bin Covering with Limited Migration |
Berndt, Sebastian et al. |
2019 |
| 4 |
A New and Improved Algorithm for Online Bin Packing |
Balogh, János et al. |
2018 |
| 5 |
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs |
Koutecký, Martin et al. |
2018 |
| 6 |
Online Bin Packing with Cardinality Constraints Resolved |
Balogh, Janos et al. |
2017 |
| 7 |
Improved Bounds for Online Preemptive Matching |
Epstein, Leah et al. |
2013 |
| 8 |
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model |
Epstein, Leah et al. |
2010 |
| 9 |
Approximating min-max k-clustering |
Levin, Asaf |
2007 |
| 10 |
Tracking mobile users |
Epstein, Leah et al. |
2005 |
