In the semi-streaming model for processing massive graphs, an algorithm makes multiple
passes over the edges of a given n-vertex graph and is tasked with computing the solution to …

The celebrated palette sparsification result of [Assadi, Chen, and Khanna SODA'19] shows
that to compute a Δ+ 1 coloring of the graph, where Δ denotes the maximum degree, it …

This paper improves and in two cases nearly settles, up to logarithmically lower order
factors, the deterministic complexity of some of the most central problems in distributed …

This paper addresses point-to-point packet routing in undirected networks, which is the most
important communication primitive in most networks. The main result proves the existence of …

Graph coloring is fundamental to distributed computing. We give an ultrafast distributed
algorithm for coloring cluster graphs. These graphs are obtained from the underlying …

We provide a $ O (\log^ 6\log n) $-round randomized algorithm for distance-2 coloring in
CONGEST with $\Delta^ 2+ 1$ colors. For $\Delta\gg\operatorname {poly}\log n $, this …

In this paper, we give list coloring variants of simple iterative defective coloring algorithms.
Formally, in a list defective coloring instance, each node $ v $ of a graph is given a list $ L_v …

The constructive Lov\'{a} sz Local Lemma has become a central tool for designing efficient
distributed algorithms. While it has been extensively studied in the classic LOCAL model that …

We obtain improved distributed algorithms in the CONGEST message-passing setting for
problems on power graphs of an input graph $ G $. This includes Coloring, Maximal …

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 …