| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2025 | B | conf |
An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding.
IPCO
|
| 2025 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Math. Program.
|
| 2024 | J | jnl |
Algorithmica
|
| 2023 | A | conf |
APPROX/RANDOM
|
| 2023 | A* | conf |
ICALP
|
| 2023 | J | jnl |
CoRR
|
| 2023 | A* | conf |
ICALP
|
| 2022 | J | jnl |
SIAM J. Discret. Math.
|
| 2022 | — | conf |
SOSA
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A | conf |
APPROX/RANDOM
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | — | conf |
FSTTCS
|
| 2021 | A* | conf |
ICALP
|
| 2020 | — | conf |
APPROX-RANDOM
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | A* | conf |
FOCS
|
| 2017 | B | conf |
IPCO
|
| 2017 | J | jnl |
CoRR
|