Yannic Maus

activity

20152026

most citedImproved Distributed Degree Splitting and Edge Coloring

6 citations · 27 across the 32 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

cs.DS2018

Deterministic Distributed Ruling Sets of Line Graphs

Fabian Kuhn, Yannic Maus, Simon Weidner

An $(α, β)$ -ruling set of a graph $G = (V, E)$ is a set $R \subseteq V$ such that for any node $v \in V$ there is a node $u \in R$ in distance at most $β$ from $v$ and such that any two n…

cs.DS2018★ 1 cited

Improved Distributed $Δ$ -Coloring

Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn +1

We present a randomized distributed algorithm that computes a $Δ$ -coloring in any non-complete graph with maximum degree $Δ \geq 4$ in $O (lo g Δ) + 2^{O (l o g l o g n)}$ rounds,…

cs.DS2018

Local Distributed Algorithms in Highly Dynamic Networks

Philipp Bamberger, Fabian Kuhn, Yannic Maus

The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always…

Deterministic Distributed Ruling Sets of Line Graphs

Improved Distributed Δ-Coloring

Local Distributed Algorithms in Highly Dynamic Networks

Improved Distributed $Δ$ -Coloring