Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. - Dan Hefetz; Fabian Kuhn; Yannic Maus; Angelika Steger (DISC, 2016)

Greedy Routing and the Algorithmic Small-World Phenomenom. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (CoRR, 2016)

On the complexity of local distributed graph problems. - Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus (STOC, 2017)

DISC 2017 Review. - Manuela Fischer; Yannic Maus (SIGACT News, 2017)

Improved Distributed Delta-Coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus (PODC, 2018)

Deterministic Distributed Ruling Sets of Line Graphs. - Fabian Kuhn; Yannic Maus; Simon Weidner (SIROCCO, 2018)

Deterministic distributed edge-coloring with fewer colors. - Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus; Jara Uitto (STOC, 2018)

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks. - Philipp Bamberger; Fabian Kuhn; Yannic Maus (DISC, 2018)

The power of locality: exploring the limits of randomness in distributed computing. - Yannic Maus (2018)

Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. - Frederik Mallmann-Trenn; Yannic Maus; Dominik Pajak (ICALP, 2019)

Local Distributed Algorithms in Highly Dynamic Networks. - Philipp Bamberger; Fabian Kuhn; Yannic Maus (IPDPS, 2019)

On the Complexity of Distributed Splitting Problems. - Philipp Bamberger; Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus; Jara Uitto (PODC, 2019)

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Yannic Maus; Jara Uitto (PODC, 2019)

Deterministic Distributed Dominating Set Approximation in the CONGEST Model. - Janosch Deurer; Fabian Kuhn; Yannic Maus (PODC, 2019)

P-SLOCAL-Completeness of Maximum Independent Set Approximation. - Yannic Maus (PODC, 2019)

Brief Announcement: Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (PODC, 2020)

Efficient Deterministic Distributed Coloring with Small Bandwidth. - Philipp Bamberger; Fabian Kuhn; Yannic Maus (PODC, 2020)

Distributed Approximation on Power Graphs. - Reuven Bar-Yehuda; Keren Censor-Hillel; Yannic Maus; Shreyas Pai; Sriram V. Pemmaraju (PODC, 2020)

Distance-2 Coloring in the CONGEST Model. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus (PODC, 2020)

Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2020)

Coloring Fast Without Learning Your Neighbors' Colors. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus; Alexandre Nolin (DISC, 2020)

Local Conflict Coloring Revisited: Linial for Lists. - Yannic Maus; Tigran Tonoyan (DISC, 2020)

Improved distributed degree splitting and edge coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus; Jukka Suomela; Jara Uitto (Distributed Comput., 2020)

The power of locality: Exploring the limits of randomness in distributed computing. - Yannic Maus (it Inf. Technol., 2020)

Rumor spreading with bounded in-degree. - Sebastian Daum; Fabian Kuhn; Yannic Maus (Theor. Comput. Sci., 2020)

Near-Optimal Scheduling in the Congested Clique. - Keren Censor-Hillel; Yannic Maus; Volodymyr Polosukhin (SIROCCO, 2021)

Efficient randomized distributed coloring in CONGEST. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus; Tigran Tonoyan (STOC, 2021)

Locally Checkable Labelings with Small Messages. - Alkida Balliu; Keren Censor-Hillel; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2021)

Efficient CONGEST Algorithms for the Lovász Local Lemma. - Yannic Maus; Jara Uitto (DISC, 2021)

Improved distributed Δ-coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus (Distributed Comput., 2021)

Distributed Vertex Cover Reconfiguration. - Keren Censor-Hillel; Yannic Maus; Shahar Romem Peled; Tigran Tonoyan (ITCS, 2022)

Exponential Speedup over Locality in MPC with Optimal Memory. - Alkida Balliu; Sebastian Brandt 002; Manuela Fischer; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (DISC, 2022)

Fast Distributed Vertex Splitting with Applications. - Magnús M. Halldórsson; Yannic Maus; Alexandre Nolin (DISC, 2022)

Linial for lists. - Yannic Maus; Tigran Tonoyan (Distributed Comput., 2022)

Greedy routing and the algorithmic small-world phenomenon. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (J. Comput. Syst. Sci., 2022)

Drawings of Complete Multipartite Graphs up to Triangle Flips. - Oswin Aichholzer; Man-Kwun Chiu; Hung P. Hoang 001; Michael Hoffmann 001; Jan Kyncl; Yannic Maus; Birgit Vogtenhuber; Alexandra Weinberger (SoCG, 2023)

Optimal Deterministic Massively Parallel Connectivity on Forests. - Alkida Balliu; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (SODA, 2023)

Fast Distributed Brooks' Theorem. - Manuela Fischer; Magnús M. Halldórsson; Yannic Maus (SODA, 2023)

Fast Dynamic Programming in Trees in the MPC Model. - Chetan Gupta 002; Rustam Latypov; Yannic Maus; Shreyas Pai; Simo Särkkä; Jan Studený; Jukka Suomela; Jara Uitto; Hossein Vahidi 001 (SPAA, 2023)

Adaptive Massively Parallel Connectivity in Optimal Space. - Rustam Latypov; Jakub Lacki; Yannic Maus; Jara Uitto (SPAA, 2023)

Conditionally Optimal Parallel Coloring of Forests. - Christoph Grunau; Rustam Latypov; Yannic Maus; Shreyas Pai; Jara Uitto (DISC, 2023)

Distributed Graph Coloring Made Easy. - Yannic Maus (ACM Trans. Parallel Comput., 2023)

Adaptive Massively Parallel Coloring in Sparse Graphs. - Rustam Latypov; Yannic Maus; Shreyas Pai; Jara Uitto (PODC, 2024)

Distributed Delta-Coloring Under Bandwidth Limitations. - Magnús M. Halldórsson; Yannic Maus (DISC, 2024)

Distributed Lovász Local Lemma under Bandwidth Limitations. - Magnús M. Halldórsson; Yannic Maus; Saku Peltonen (CoRR, 2024)

Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs. - Malte Baumecker; Yannic Maus; Jara Uitto (PODC, 2025)

Brief Announcement: Towards Optimal Distributed Delta Coloring. - Manuel Jakob; Yannic Maus (PODC, 2025)

On the Locality of Hall's Theorem. - Sebastian Brandt 002; Yannic Maus; Ananth Narayanan; Florian Schager; Jara Uitto (SODA, 2025)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring. - Samuel Baguley; Yannic Maus; Janosch Ruff; George Skretas (STACS, 2025)

Towards Optimal Distributed Delta Coloring. - Manuel Jakob; Yannic Maus (CoRR, 2025)

Towards Optimal Distributed Edge Coloring with Small Palettes. - Manuel Jakob; Yannic Maus; Florian Schager (CoRR, 2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs. - Malte Baumecker; Yannic Maus; Jara Uitto (CoRR, 2025)

On Distributed Colouring of Hyperbolic Random Graphs. - Yannic Maus; Janosch Ruff (CoRR, 2025)

Distributed symmetry breaking on power graphs via sparsification. - Yannic Maus; Saku Peltonen; Jara Uitto (Distributed Comput., 2025)