Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. - Florian Barbero; Gregory Z. Gutin; Mark Jones 001; Bin Sheng 002; Anders Yeo (Inf. Process. Lett., 2016)

Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (ICALP, 2017)

Parameterized and Approximation Algorithms for the Load Coloring Problem. - Florian Barbero; Gregory Z. Gutin; Mark Jones 001; Bin Sheng 002 (Algorithmica, 2017)

Strong immersion is a well-quasi-ordering for semi-complete digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (CoRR, 2017)

Quasiperiods of biinfinite Sturmian words. - Florian Barbero; Guilhem Gamard; Anaël Grandjean (CoRR, 2018)

Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (ACM Trans. Algorithms, 2018)

Strong immersion is a well-quasi-ordering for semicomplete digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (J. Graph Theory, 2019)

On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs. - Florian Barbero; Lucas Isenmann; Jocelyn Thiebaut (Algorithmica, 2020)

Quasiperiods of biinfinite words. - Florian Barbero; Guilhem Gamard; Anaël Grandjean (Eur. J. Comb., 2020)