
Improved Distributed Lower Bounds for MIS and Bounded (Out)Degree Dominating Sets in Trees
Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first ω(log...
read it

Efficient Randomized Distributed Coloring in CONGEST
Distributed vertex coloring is one of the classic problems and probably ...
read it

Approximate Bipartite Vertex Cover in the CONGEST Model
We give efficient distributed algorithms for the minimum vertex cover pr...
read it

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
We present a simple deterministic distributed algorithm that computes a ...
read it

Coloring Fast Without Learning Your Neighbors' Colors
We give an improved randomized CONGEST algorithm for distance2 coloring...
read it

Computing Shortest Paths and Diameter in the Hybrid Network Model
The 𝖧𝖸𝖡𝖱𝖨𝖣 model, introduced in [Augustine et al., SODA '20], provides a...
read it

Distance2 Coloring in the CONGEST Model
We give efficient randomized and deterministic distributed algorithms fo...
read it

Distributed Edge Coloring in Time QuasiPolylogarithmic in Delta
The problem of coloring the edges of an nnode graph of maximum degree Δ...
read it

Distributed Maximum Matching Verification in CONGEST
We study the maximum cardinality matching problem in a standard distribu...
read it

Efficient Deterministic Distributed Coloring with Small Bandwidth
We show that the (degree+1)list coloring problem can be solved determin...
read it

Shortest Paths in a Hybrid Network Model
We introduce a communication model for hybrid networks, where nodes have...
read it

Faster Deterministic Distributed Coloring Through Recursive List Coloring
We provide novel deterministic distributed vertex coloring algorithms. A...
read it

On the Use of Randomness in Local Distributed Graph Algorithms
We attempt to better understand randomization in local distributed graph...
read it

On the Complexity of Distributed Splitting Problems
One of the fundamental open problems in the area of distributed graph al...
read it

Deterministic Distributed Dominating Set Approximation in the CONGEST Model
We develop deterministic approximation algorithms for the minimum domina...
read it

Latency, Capacity, and Distributed MST
Consider the problem of building a minimumweight spanning tree for a gi...
read it

Competitive Concurrent Distributed Scheduling
We introduce a new scheduling problem in distributed computing that we c...
read it

Optimal strategies for patrolling fences
A classical multiagent fence patrolling problem asks: What is the maxim...
read it

The Communication Cost of Information Spreading in Dynamic Networks
This paper investigates the message complexity of distributed informatio...
read it

Distributed Computation in the NodeCongested Clique
The Congested Clique model of distributed computing, which was introduce...
read it

Deterministic Distributed Ruling Sets of Line Graphs
An (α,β)ruling set of a graph G=(V,E) is a set R⊆ V such that for any n...
read it

Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs
Given a graph, a maximal independent set (MIS) is a maximal subset of pa...
read it

Improved Distributed ΔColoring
We present a randomized distributed algorithm that computes a Δcoloring...
read it

Local Distributed Algorithms in Highly Dynamic Networks
The present paper studies local distributed graph problems in highly dyn...
read it

Deterministic Distributed EdgeColoring with Fewer Colors
We present a deterministic distributed algorithm, in the LOCAL model, th...
read it

On Derandomizing Local Distributed Algorithms
The gap between the known randomized and deterministic local distributed...
read it
Fabian Kuhn
is this you? claim profile