| 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 |
Online Bin Packing with Cardinality Constraints Resolved |
Balogh, Janos et al. |
2017 |
| 6 |
Improved Bounds for Online Preemptive Matching |
Epstein, Leah et al. |
2013 |
| 7 |
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model |
Epstein, Leah et al. |
2010 |
| 8 |
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy |
Epstein, Leah |
2007 |
| 9 |
Maximizing the Minimum Load for Selfisch Agents |
Epstein, Leah et al. |
2007 |
| 10 |
Online scheduling of splittable tasks |
Epstein, Leah et al. |
2005 |
| 11 |
Tracking mobile users |
Epstein, Leah et al. |
2005 |
