Yannic Maus

Orcid: 0000-0003-4062-6991

Affiliations:
  • TU Graz, Austria


According to our database1, Yannic Maus authored at least 47 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring.
CoRR, 2024

Distributed Lovász Local Lemma under Bandwidth Limitations.
CoRR, 2024

Distributed Delta-Coloring Under Bandwidth Limitations.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Adaptive Massively Parallel Coloring in Sparse Graphs.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Distributed Graph Coloring Made Easy.
ACM Trans. Parallel Comput., December, 2023

Conditionally Optimal Parallel Coloring of Forests.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Adaptive Massively Parallel Connectivity in Optimal Space.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Fast Dynamic Programming in Trees in the MPC Model.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Fast Distributed Brooks' Theorem.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Deterministic Massively Parallel Connectivity on Forests.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distributed Symmetry Breaking on Power Graphs via Sparsification.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Greedy routing and the algorithmic small-world phenomenon.
J. Comput. Syst. Sci., 2022

Linial for lists.
Distributed Comput., 2022

Fast Distributed Vertex Splitting with Applications.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Exponential Speedup over Locality in MPC with Optimal Memory.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Distributed Vertex Cover Reconfiguration.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Improved distributed Δ-coloring.
Distributed Comput., 2021

Efficient CONGEST Algorithms for the Lovász Local Lemma.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Locally Checkable Labelings with Small Messages.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Efficient randomized distributed coloring in CONGEST.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Near-Optimal Scheduling in the Congested Clique.
Proceedings of the Structural Information and Communication Complexity, 2021

2020
Rumor spreading with bounded in-degree.
Theor. Comput. Sci., 2020

The power of locality: Exploring the limits of randomness in distributed computing.
it Inf. Technol., 2020

Improved distributed degree splitting and edge coloring.
Distributed Comput., 2020

Local Conflict Coloring Revisited: Linial for Lists.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Coloring Fast Without Learning Your Neighbors' Colors.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Classification of Distributed Binary Labeling Problems.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Distance-2 Coloring in the CONGEST Model.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Approximation on Power Graphs.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Efficient Deterministic Distributed Coloring with Small Bandwidth.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
P-SLOCAL-Completeness of Maximum Independent Set Approximation.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Deterministic Distributed Dominating Set Approximation in the CONGEST Model.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Complexity of Distributed Splitting Problems.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Local Distributed Algorithms in Highly Dynamic Networks.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
The power of locality: exploring the limits of randomness in distributed computing.
PhD thesis, 2018

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic distributed edge-coloring with fewer colors.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Deterministic Distributed Ruling Sets of Line Graphs.
Proceedings of the Structural Information and Communication Complexity, 2018

Improved Distributed Delta-Coloring.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
DISC 2017 Review.
SIGACT News, 2017

On the complexity of local distributed graph problems.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Greedy Routing and the Algorithmic Small-World Phenomenom.
CoRR, 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.
Proceedings of the Distributed Computing - 30th International Symposium, 2016


  Loading...