Follow
Yannic Maus
Yannic Maus
Verified email at ist.tugraz.at - Homepage
Title
Cited by
Cited by
Year
On the complexity of local distributed graph problems
M Ghaffari, F Kuhn, Y Maus
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
1362017
Classification of distributed binary labeling problems
A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela
arXiv preprint arXiv:1911.13294, 2019
482019
Improved distributed delta-coloring
M Ghaffari, J Hirvonen, F Kuhn, Y Maus
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
422018
Deterministic distributed edge-coloring with fewer colors
M Ghaffari, F Kuhn, Y Maus, J Uitto
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
422018
Greedy routing and the algorithmic small-world phenomenon
K Bringmann, R Keusch, J Lengler, Y Maus, AR Molla
Proceedings of the ACM Symposium on Principles of Distributed Computing, 371-380, 2017
392017
Efficient deterministic distributed coloring with small bandwidth
P Bamberger, F Kuhn, Y Maus
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
382020
Local conflict coloring revisited: Linial for lists
Y Maus, T Tonoyan
arXiv preprint arXiv:2007.15251, 2020
372020
Rumor spreading with bounded in-degree
S Daum, F Kuhn, Y Maus
Theoretical Computer Science 810, 43-57, 2020
362020
Deterministic distributed dominating set approximation in the CONGEST model
J Deurer, F Kuhn, Y Maus
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
292019
Efficient randomized distributed coloring in CONGEST
MM Halldórsson, F Kuhn, Y Maus, T Tonoyan
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
282021
Improved distributed degree splitting and edge coloring
M Ghaffari, J Hirvonen, F Kuhn, Y Maus, J Suomela, J Uitto
Distributed Computing 33 (3), 293-310, 2020
272020
Deterministic distributed ruling sets of line graphs
F Kuhn, Y Maus, S Weidner
International Colloquium on Structural Information and Communication …, 2018
262018
Distributed graph coloring made easy
Y Maus
ACM Transactions on Parallel Computing 10 (4), 1-21, 2023
222023
Polynomial lower bound for distributed graph coloring in a weak LOCAL model
D Hefetz, F Kuhn, Y Maus, A Steger
International Symposium on Distributed Computing, 99-113, 2016
202016
Locally checkable labelings with small messages
A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela
arXiv preprint arXiv:2105.05574, 2021
182021
Distance-2 coloring in the CONGEST model
MM Halldórsson, F Kuhn, Y Maus
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
152020
Local distributed algorithms in highly dynamic networks
P Bamberger, F Kuhn, Y Maus
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
132019
A sharp threshold phenomenon for the distributed complexity of the lovįsz local lemma
S Brandt, Y Maus, J Uitto
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
112019
Fast distributed Brooks' theorem
M Fischer, MM Halldórsson, Y Maus
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
102023
Coloring fast without learning your neighbors' colors
MM Halldórsson, F Kuhn, Y Maus, A Nolin
arXiv preprint arXiv:2008.04303, 2020
102020
The system can't perform the operation now. Try again later.
Articles 1–20