38 citations · 178 across the 46 of their papers we have counts for
7 papers · 1 filter
Optimal strategies for patrolling fences
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson +2
A classical multi-agent fence patrolling problem asks: What is the maximum length of a line that agents with maximum speeds can patrol if each point on the…
The Communication Cost of Information Spreading in Dynamic Networks
Mohamad Ahmadi, Fabian Kuhn, Shay Kutten +2
This paper investigates the message complexity of distributed information spreading (a.k.a gossip or token dissemination) in adversarial dynamic networks, where the goal is to spre…
Deterministic Distributed Ruling Sets of Line Graphs
Fabian Kuhn, Yannic Maus, Simon Weidner
An -ruling set of a graph is a set such that for any node there is a node in distance at most from and such that any two n…
Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs
Fabian Kuhn, Chaodong Zheng
Given a graph, a maximal independent set (MIS) is a maximal subset of pairwise non-adjacent vertices. Finding an MIS is a fundamental problem in distributed computing. Although the…
Distributed Computation in Node-Capacitated Networks
John Augustine, Mohsen Ghaffari, Robert Gmyr +4
In this paper, we study distributed graph algorithms in networks in which the nodes have a limited communication capacity. Many distributed systems are built on top of an underlyin…
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 in rounds,…