| No. |
Title |
Author |
Year |
| 1 |
Maximum Coverage in Random-Arrival Streams |
Warneke, Rowan et al. |
2023 |
| 2 |
Maximum Coverage in Sublinear Space, Faster |
Jaud, Stephen et al. |
2023 |
| 3 |
An Almost Optimal Algorithm for Unbounded Search with Noisy Information |
Gan, Junhao et al. |
2022 |
| 4 |
Graph Clustering in All Parameter Regimes |
Gan, Junhao et al. |
2020 |
| 5 |
Recency Queries with Succinct Representation |
Holland, William L. et al. |
2020 |
| 6 |
Result-Sensitive Binary Search with Noisy Information |
Epa, Narthana S. et al. |
2019 |
| 7 |
Correlation Clustering Generalized |
Gleich, David F. et al. |
2018 |
| 8 |
Precedence-Constrained Min Sum Set Cover |
McClintock, Jessica et al. |
2017 |
| 9 |
On Approximating Target Set Selection |
Charikar, Moses et al. |
2016 |
