Florian Barbero

15 papers A* 1B 2Journal 12
YearRankTypeTitle / Venue / Authors
2020 J jnl
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs.
Algorithmica
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
2020 J jnl
Quasiperiods of biinfinite words.
Eur. J. Comb.
Florian Barbero, Guilhem Gamard, Anaël Grandjean
2019 J jnl
Strong immersion is a well-quasi-ordering for semicomplete digraphs.
J. Graph Theory
Florian Barbero, Christophe Paul, Michal Pilipczuk
2018 J jnl
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs.
ACM Trans. Algorithms
Florian Barbero, Christophe Paul, Michal Pilipczuk
2018 B conf
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs.
IPEC
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
2018 J jnl
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs.
CoRR
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
2018 J jnl
Quasiperiods of biinfinite Sturmian words.
CoRR
Florian Barbero, Guilhem Gamard, Anaël Grandjean
2017 A* conf
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs.
ICALP
Florian Barbero, Christophe Paul, Michal Pilipczuk
2017 J jnl
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs.
CoRR
Florian Barbero, Christophe Paul, Michal Pilipczuk
2017 J jnl
Parameterized and Approximation Algorithms for the Load Coloring Problem.
Algorithmica
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
2017 J jnl
Strong immersion is a well-quasi-ordering for semi-complete digraphs.
CoRR
Florian Barbero, Christophe Paul, Michal Pilipczuk
2016 J jnl
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.
Inf. Process. Lett.
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
2015 J jnl
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths.
CoRR
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
2015 B conf
Parameterized and Approximation Algorithms for the Load Coloring Problem.
IPEC
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
2014 J jnl
Parameterized and Approximation Algorithms for the Load Coloring Problem.
CoRR
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng