Dan Hefetz, Fabian Kuhn, Yannic Maus and Angelika Steger Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
Publikation in PURE anzeigen
Sebastian Daum, Fabian Kuhn and Yannic Maus Rumor Spreading with Bounded In-Degree
Publikation in PURE anzeigen
Mohsen Ghaffari, Fabian Kuhn and Yannic Maus On the complexity of local distributed graph problems
Publikation in PURE anzeigen
Manuela Fischer and Yannic Maus DISC 2017 Review
Publikation in PURE anzeigen
Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus and Anisur Rahaman Molla Greedy Routing and the Algorithmic Small-World Phenomenon
Publikation in PURE anzeigen
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela and Jara Uitto Improved Distributed Degree Splitting and Edge Coloring
Publikation in PURE anzeigen
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn and Yannic Maus Improved Distributed Delta-Coloring
Publikation in PURE anzeigen
Fabian Kuhn, Yannic Maus and Simon Weidner Deterministic Distributed Ruling Sets of Line Graphs
Publikation in PURE anzeigen
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus and Jara Uitto Deterministic distributed edge-coloring with fewer colors
Publikation in PURE anzeigen
Philipp Bamberger, Fabian Kuhn and Yannic Maus Brief Announcement - Local Distributed Algorithms in Highly Dynamic Networks
Publikation in PURE anzeigen
Frederik Mallmann-Trenn, Yannic Maus and Dominik Pajak Noidy Conmunixatipn - On the Convergence of the Averaging Population Protocol
Publikation in PURE anzeigen
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus and Jara Uitto On the Complexity of Distributed Splitting Problems
Publikation in PURE anzeigen
Philipp Bamberger, Fabian Kuhn and Yannic Maus Local Distributed Algorithms in Highly Dynamic Networks
Publikation in PURE anzeigen
Yannic Maus P-SLOCAL-Completeness of Maximum Independent Set Approximation
Publikation in PURE anzeigen
Janosch Deurer, Fabian Kuhn and Yannic Maus Deterministic Distributed Dominating Set Approximation in the CONGEST Model
Publikation in PURE anzeigen
Sebastian Brandt, Yannic Maus and Jara Uitto A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Publikation in PURE anzeigen
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela and Jara Uitto Improved distributed degree splitting and edge coloring.
Publikation in PURE anzeigen
Yannic Maus The power of locality - Exploring the limits of randomness in distributed computing.
Publikation in PURE anzeigen
Sebastian Daum, Fabian Kuhn and Yannic Maus Rumor spreading with bounded in-degree.
Publikation in PURE anzeigen
Philipp Bamberger, Fabian Kuhn and Yannic Maus Efficient Deterministic Distributed Coloring with Small Bandwidth.
Publikation in PURE anzeigen
Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai and Sriram V. Pemmaraju Distributed Approximation on Power Graphs
Publikation in PURE anzeigen
Magnús M. Halldórsson, Fabian Kuhn and Yannic Maus Distance-2 Coloring in the CONGEST Model
Publikation in PURE anzeigen
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus and Alexandre Nolin Coloring Fast Without Learning Your Neighbors' Colors
Publikation in PURE anzeigen
Yannic Maus and Tigran Tonoyan Local Conflict Coloring Revisited - Linial for Lists
Publikation in PURE anzeigen
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti and Jukka Suomela Classification of Distributed Binary Labeling Problems
Publikation in PURE anzeigen
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti and Jukka Suomela Brief Announcement - Classification of Distributed Binary Labeling Problems
Publikation in PURE anzeigen
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn and Yannic Maus Improved distributed Δ-coloring.
Publikation in PURE anzeigen
Keren Censor-Hillel, Yannic Maus and Volodymyr Polosukhin Near-Optimal Scheduling in the Congested Clique.
Publikation in PURE anzeigen
Yannic Maus Distributed Graph Coloring Made Easy
Publikation in PURE anzeigen
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus and Tigran Tonoyan Efficient randomized distributed coloring in CONGEST
Publikation in PURE anzeigen
Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti and Jukka Suomela Locally Checkable Labelings with Small Messages.
Publikation in PURE anzeigen
Yannic Maus and Jara Uitto Efficient CONGEST Algorithms for the Lovász Local Lemma.
Publikation in PURE anzeigen
Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus and Anisur Rahaman Molla Greedy routing and the algorithmic small-world phenomenon.
Publikation in PURE anzeigen
Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled and Tigran Tonoyan Distributed Vertex Cover Reconfiguration
Distributed Vertex Cover Reconfiguration
36:1-36:23
Publikation in PURE anzeigen
Yannic Maus and Tigran Tonoyan Linial for lists.
Publikation in PURE anzeigen
Oswin Aichholzer, Man-Kwun Chiu, Phuc Hung Hoang, Michael Hoffmann, Yannic Maus, Birgit Vogtenhuber and Alexandra Weinberger Gioan’s Theorem for complete bipartite graphs
Publikation in PURE anzeigen
Magnús M. Halldórsson, Yannic Maus and Alexandre Nolin Fast Distributed Vertex Splitting with Applications.
36th International Symposium on Distributed Computing (DISC 2022)
26:1-26:24
Publikation in PURE anzeigen
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti and Jara Uitto Exponential Speedup over Locality in MPC with Optimal Memory.
36th International Symposium on Distributed Computing (DISC 2022)
9:1-9:21
Publikation in PURE anzeigen
Oswin Aichholzer, Man-Kwun Chiu, Phuc Hung Hoang, Michael Hoffmann, Yannic Maus, Birgit Vogtenhuber and Alexandra Weinberger Gioan’s Theorem for complete bipartite graphs
Proc. $38^th$ European Workshop on Computational Geometry (EuroCG 2022)
31:1-31:6
Publikation in PURE anzeigen
Yannic Maus, Saku Peltonen and Jara Uitto Distributed Symmetry Breaking on Power Graphs via Sparsification
PODC 2023 - Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
157-167
Publikation in PURE anzeigen
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto and Hossein Vahidi Fast Dynamic Programming in Trees in the MPC Model
SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
443-453
Publikation in PURE anzeigen
Rustam Latypov, Jakub Łacki, Yannic Maus and Jara Uitto Adaptive Massively Parallel Connectivity in Optimal Space
SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
431-441
Publikation in PURE anzeigen
Oswin Aichholzer, Man Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber and Alexandra Weinberger Drawings of Complete Multipartite Graphs up to Triangle Flips
39th International Symposium on Computational Geometry, SoCG 2023
Publikation in PURE anzeigen
Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai and Jara Uitto Conditionally Optimal Parallel Coloring of Forests
37th International Symposium on Distributed Computing, DISC 2023
Publikation in PURE anzeigen
Yannic Maus Distributed Graph Coloring Made Easy
Publikation in PURE anzeigen
Manuela Fischer, Magnús M. Halldórsson and Yannic Maus Fast Distributed Brooks' Theorem.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023.
2567-2588
Publikation in PURE anzeigen
Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti and Jara Uitto Optimal Deterministic Massively Parallel Connectivity on Forests
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
2589-2631
Publikation in PURE anzeigen