activity
20142018
most citedOn the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2018

Quasiperiods of biinfinite Sturmian words

Florian Barbero, Guilhem Gamard, Anaël Grandjean

We study the notion of quasiperiodicity, in the sense of "coverability", for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the pas…

cs.DM2017

Strong immersion is a well-quasi-ordering for semi-complete digraphs

Florian Barbero, Christophe Paul, Michal Pilipczuk

We prove that the strong immersion order is a well-quasi-ordering on the class of semi-complete digraphs, thereby strengthening a result of Chudnovsky and Seymour that this holds f…