32 citations · 76 across the 27 of their papers we have counts for
5 papers · 1 filter
When Should You Wait Before Updating? Toward a Robustness Refinement
Swan Dubois, Laurent Feuilloley, Franck Petit +1
Consider a dynamic network and a given distributed problem. At any point in time, there might exist several solutions that are equally good with respect to the problem specificatio…
Pattern detection in ordered graphs
Guillaume Ducoffe, Laurent Feuilloley, Michel Habib +1
A popular way to define or characterize graph classes is via forbidden subgraphs or forbidden minors. These characterizations play a key role in graph theory, but they rarely lead…
Bibliography of distributed approximation beyond bounded degree
Laurent Feuilloley
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there…
Lower bounds for text indexing with mismatches and differences
Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
In this paper we study lower bounds for the fundamental problem of text indexing with mismatches and differences. In this problem we are given a long string of length , the "tex…
Graph classes and forbidden patterns on three vertices
Laurent Feuilloley, Michel Habib
This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs. Unfortuna…