6 citations · 27 across the 32 of their papers we have counts for
4 papers · 1 filter
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
Samuel Baguley, Yannic Maus, Janosch Ruff +1
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient.…
Distributed Delta-Coloring under Bandwidth Limitations
Yannic Maus, Magnús M. Halldórsson
We consider the problem of coloring graphs of maximum degree with colors in the distributed setting with limited bandwidth. Specifically, we give a $\mathsf{poly}\log\log n…
Distributed Lovász Local Lemma under Bandwidth Limitations
Magnús M. Halldórsson, Yannic Maus, Saku Peltonen
The constructive Lovász Local Lemma has become a central tool for designing efficient distributed algorithms. While it has been extensively studied in the classic LOCAL model that…
Adaptive Massively Parallel Coloring in Sparse Graphs
Rustam Latypov, Yannic Maus, Shreyas Pai +1
Classic symmetry-breaking problems on graphs have gained a lot of attention in models of modern parallel computation. The Adaptive Massively Parallel Computation (AMPC) is a model…