| Publication | Date of Publication | Type |
|---|
| Local Max-Cut on sparse graphs | 2026-05-26 | Paper |
| Fast deterministic algorithms for highly-dynamic networks | 2026-03-31 | Paper |
| Stochastic distance in property testing | 2025-10-06 | Paper |
scientific article; zbMATH DE number 7774285 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
| Models of smoothing in dynamic networks | 2023-11-02 | Paper |
| Improved distributed approximations for maximum independent set | 2023-11-02 | Paper |
Optimal distributed covering algorithms
Distributed Computing | 2023-03-14 | Paper |
| Derandomizing local distributed algorithms under bandwidth restrictions | 2023-02-03 | Paper |
| Optimal distributed covering algorithms | 2023-02-03 | Paper |
| Parameterized distributed algorithms | 2023-02-03 | Paper |
Adapting local sequential algorithms to the distributed setting
(available as arXiv preprint) | 2022-07-21 | Paper |
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Optimal Distributed Covering Algorithms
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Optimal Distributed Covering Algorithms
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Derandomizing local distributed algorithms under bandwidth restrictions
Distributed Computing | 2020-06-15 | Paper |
Derandomizing local distributed algorithms under bandwidth restrictions
Distributed Computing | 2020-06-15 | Paper |
A \((2+\epsilon)\)-approximation for maximum weight matching in the semi-streaming model
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Fast distributed algorithms for testing graph properties
Distributed Computing | 2019-03-21 | Paper |
A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds
(available as arXiv preprint) | 2019-01-30 | Paper |
Fast distributed algorithms for testing graph properties
Lecture Notes in Computer Science | 2018-08-16 | Paper |
A \((2 + \epsilon)\)-approximation for maximum weight matching in the semi-streaming model
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
Journal of the ACM | 2018-05-17 | Paper |
Distributed approximation of maximum independent set and maximum matching
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
