26 citations · 100 across the 29 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
Malte Baumecker, Yannic Maus, Jara Uitto
Given a graph , a -ruling set is a subset that is i) independent, and ii) every node has a node of within distance . In this paper we pre…
cs.DS2025
On the Locality of Hall's Theorem
Sebastian Brandt, Yannic Maus, Ananth Narayanan +2
The last five years of research on distributed graph algorithms have seen huge leaps of progress, both regarding algorithmic improvements and impossibility results: new strong lowe…