32 citations · 76 across the 27 of their papers we have counts for
3 papers · 2 filters
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…