Consider a dynamic network and a given distributed problem. At any point...
In this paper, we study temporal graphs arising from mobility models whe...
We propose a way to transform synchronous distributed algorithms solving...
We present a wait-free algorithm for proper coloring the n nodes of the
...
Recoloring a graph is about finding a sequence of proper colorings of th...
Can every connected graph burn in ⌈√(n)⌉ steps? While this
conjecture re...
One of the fundamental and most-studied algorithmic problems in distribu...
The LOCAL model is among the main models for studying locality in the
fr...
There are distributed graph algorithms for finding maximal matchings and...
Consider a computer network that consists of a path with n nodes. The no...
Consider the following problem: given a graph and two maximal independen...
Given two colorings of a graph, we consider the following problem: can w...