| 1 |
On the complexity of local distributed graph problems |
182 |
2017 |
| 2 |
Classification of distributed binary labeling problems |
65 |
2019 |
| 3 |
Deterministic distributed edge-coloring with fewer colors |
65 |
2018 |
| 4 |
Improved distributed delta-coloring |
65 |
2018 |
| 5 |
Local conflict coloring revisited: Linial for lists |
54 |
2020 |
| 6 |
Efficient deterministic distributed coloring with small bandwidth |
46 |
2020 |
| 7 |
Greedy routing and the algorithmic small-world phenomenon |
45 |
2017 |
| 8 |
Efficient randomized distributed coloring in CONGEST |
42 |
2021 |
| 9 |
Deterministic distributed dominating set approximation in the CONGEST model |
39 |
2019 |
| 10 |
Distributed graph coloring made easy |
39 |
2023 |
| 11 |
Rumor spreading with bounded in-degree |
37 |
2020 |
| 12 |
Improved distributed degree splitting and edge coloring |
36 |
2017 |
| 13 |
Locally checkable labelings with small messages |
34 |
2021 |
| 14 |
Fast distributed Brooks' theorem |
29 |
2023 |
| 15 |
Deterministic distributed ruling sets of line graphs |
28 |
2018 |
| 16 |
Distance-2 coloring in the CONGEST model |
23 |
2020 |
| 17 |
Polynomial lower bound for distributed graph coloring in a weak LOCAL model |
23 |
2016 |