There is a recent exciting line of work in distributed graph algorithms in the CONGEST
model that exploit expanders. All these algorithms so far are based on two tools: expander …

We present improved distributed algorithms for variants of the triangle finding problem in the
model. We show that triangle detection, counting, and enumeration can be solved in rounds …

An (ε, φ)-expander decomposition of a graph G=(V, E) is a clustering of the vertices V=
V1∪…∪ Vx such that (1) each cluster Vi induces subgraph with conductance at least φ, and …

This paper studies lower bounds for fundamental optimization problems in the CONGEST
model. We show that solving problems exactly in this model can be a hard task, by providing …

In this paper we give sublinear-time distributed algorithms in the CONGEST CONGEST
model for finding or listing cliques and even-length cycles. We show for the first time that all …

We present improved distributed algorithms for triangle detection and its variants in the
CONGEST model. We show that Triangle Detection, Counting, and Enumeration can be …

The possibilities offered by quantum computing have drawn attention in the distributed
computing community recently, with several breakthrough results showing quantum …

This is a survey of the exciting recent progress made in understanding the complexity of
distributed subgraph finding problems. It overviews the results and techniques for assorted …

A rich line of work has been addressing the computational complexity of locally checkable
labelings (LCLs), illustrating the landscape of possible complexities. In this paper, we study …

The problem of detecting network structures plays a central role in distributed computing.
One of the fundamental problems studied in this area is to determine whether for a given …