Local certification consists in assigning labels (called certificates) to the nodes of a network
to certify a property of the network or the correctness of a data structure distributed on the …

Local certification consists in assigning labels to the vertices of a network to certify that some
given property is satisfied, in such a way that the labels can be checked locally. In the last …

Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a
distributed interactive proof for planarity (ie, for certifying that a network is planar), using a …

A distributed graph algorithm is basically an algorithm where every node of a graph can look
at its neighborhood at some distance in the graph and chose its output. As distributed …

We establish that every monadic second-order logic (MSO) formula on graphs with bounded
treedepth is decidable in a constant number of rounds within the CONGEST model. To our …

A proof labelling scheme for a graph class C is an assignment of certificates to the vertices of
any graph in the class C, such that upon reading its certificate and the certificates of its …

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely
useful tool in designing algorithms, as it allows us to shift from the general graph setting to …

Detecting specific structures in a network has been a very active theme of research in
distributed computing for at least a decade. In this paper, we start the study of subgraph …

Many combinatorial optimization problems, including maximum weighted matching and
maximum independent set, can be approximated within (1±ε) factors in poly (log n, 1/ε) …

We establish that every monadic second-order logic (MSO) formula on graphs with bounded
treedepth is decidable in a constant number of rounds within the CONGEST model. To our …