| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | A* | conf |
SODA
|
| 2026 | J | jnl |
CoRR
|
| 2025 | A* | conf |
PODC
|
| 2025 | A | conf |
STACS
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
CoRR
|
| 2025 | A | conf |
APPROX/RANDOM
|
| 2025 | J | jnl |
CoRR
|
| 2025 | A | conf |
ECAI
|
| 2024 | A | conf |
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound.
APPROX/RANDOM
|
| 2024 | J | jnl |
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound.
CoRR
|
| 2024 | C | conf |
SPIRE
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Proc. ACM Manag. Data
|
| 2024 | J | jnl |
CoRR
|
| 2024 | A | conf |
APPROX/RANDOM
|
| 2024 | J | jnl |
CoRR
|
| 2023 | A | conf |
APPROX/RANDOM
|
| 2023 | J | jnl |
Algorithmica
|
| 2023 | A* | conf |
SODA
|
| 2022 | B | conf |
SPAA
|
| 2022 | B | conf |
ISAAC
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A* | conf |
ICALP
|
| 2022 | J | jnl |
J. Supercomput.
|
| 2022 | J | jnl |
Algorithmica
|
| 2021 | J | jnl |
Discret. Appl. Math.
|
| 2021 | B | conf |
ISAAC
|
| 2021 | J | jnl |
CoRR
|
| 2021 | J | jnl |
ACM Trans. Economics and Comput.
|
| 2020 | J | jnl |
Algorithmica
|
| 2020 | A* | conf |
SODA
|
| 2020 | B | conf |
ISAAC
|
| 2020 | J | jnl |
CoRR
|
| 2019 | A* | conf |
ICALP
|
| 2019 | J | jnl |
CoRR
|
| 2018 | A* | conf |
SODA
|
| 2018 | J | jnl |
Algorithmica
|
| 2018 | — | conf |
WINE
|
| 2017 | A* | conf |
SODA
|
| 2017 | A* | conf |
SODA
|
| 2017 | J | jnl |
CoRR
|
| 2017 | J | jnl |
CoRR
|
| 2017 | J | jnl |
Inf. Process. Lett.
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|