F. Barbero

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 2017Show all

2 papers · 1 filter

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…

cs.DS2017

Exploring the complexity of layout parameters in tournaments and semi-complete digraphs

Florian Barbero, Christophe Paul, Michał Pilipczuk

A simple digraph is semi-complete if for any two of its vertices $u$ and $v$ , at least one of the arcs $(u, v)$ and $(v, u)$ is present. We study the complexity of computing two layo…