Manuel Jakob

most citedSublogarithmic Distributed Vertex Coloring with Optimal Number of Colors

1 citations · 1 across the 1 of their papers we have counts for

collaborators

3 papers

cs.DS2026★ 1 cited

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors

Maxime Flin, Magnús M. Halldórsson, Manuel Jakob +1

For any $Δ$ , let $k_{Δ}$ be the maximum integer $k$ such that $(k + 1) (k + 2) \leq Δ$ . We give a distributed \LOCAL algorithm that, given an integer $k < k_{Δ}$ , computes a valid $Δ - k$ -color…

cs.DS2025

Towards Optimal Distributed Edge Coloring with Fewer Colors

Manuel Jakob, Yannic Maus, Florian Schager

There is a huge difference in techniques and runtimes of distributed algorithms for problems that can be solved by a sequential greedy algorithm and those that cannot. A prime exam…

cs.DC2025

Towards Optimal Distributed Delta Coloring

Manuel Jakob, Yannic Maus

The $Δ$ -vertex coloring problem has become one of the prototypical problems for understanding the complexity of local distributed graph problems on constant-degree graphs. The majo…