33 citations · 242 across the 67 of their papers we have counts for
5 papers · 1 filter
What can be certified compactly?
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification consists in assigning labels (called \emph{certificates}) to the nodes of a network to certify a property of the network or the correctness of a data structure…
Local certification of MSO properties for bounded treedepth graphs
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
The graph model checking problem consists in testing whether an input graph satisfies a given logical formula. In this paper, we study this problem in a distributed setting, namely…
Distributed recoloring of interval and chordal graphs
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich +1
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the stu…
Local certification of graph decompositions and applications to minor-free classes
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification consists in assigning labels to the nodes of a network to certify that some given property is satisfied, in such a way that the labels can be checked locally. I…
Distributed algorithms for fractional coloring
Nicolas Bousquet, Louis Esperet, François Pirot
In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many a…