Florian Barbero

According to our database, Florian Barbero authored at least 9 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Quasiperiods of biinfinite words.

Florian Barbero, Guilhem Gamard, Anaël Grandjean

Eur. J. Comb., 2020

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

2019

Strong immersion is a well-quasi-ordering for semicomplete digraphs.

Florian Barbero, Christophe Paul, Michal Pilipczuk

J. Graph Theory, 2019

2018

Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs.

Florian Barbero, Christophe Paul, Michal Pilipczuk

ACM Trans. Algorithms, 2018

Quasiperiods of biinfinite Sturmian words.

Florian Barbero, Guilhem Gamard, Anaël Grandjean

CoRR, 2018

2017

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

Florian Barbero, Christophe Paul, Michal Pilipczuk

CoRR, 2017

Parameterized and Approximation Algorithms for the Load Coloring Problem.

Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng

Algorithmica, 2017

Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs.

Florian Barbero, Christophe Paul, Michal Pilipczuk

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.

Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo

Inf. Process. Lett., 2016