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 cs.DSShow all

3 papers · 1 filter

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…

cs.DS2015

Linear-Vertex Kernel for the Problem of Packing $r$ -Stars into a Graph without Long Induced Paths

Florian Barbero, Gregory Gutin, Mark Jones +2

Let integers $r \geq 2$ and $d \geq 3$ be fixed. Let $G_{d}$ be the set of graphs with no induced path on $d$ vertices. We study the problem of packing $k$ vertex-disjoint copies…

cs.DS2014

Parameterized and Approximation Algorithms for the Load Coloring Problem

F. Barbero, G. Gutin, M. Jones +1

Let $c, k$ be two positive integers and let $G = (V, E)$ be a graph. The $(c, k)$ -Load Coloring Problem (denoted $(c, k)$ -LCP) asks whether there is a $c$ -coloring $φ: V \rightarrow [c]…

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

Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths

Parameterized and Approximation Algorithms for the Load Coloring Problem

Linear-Vertex Kernel for the Problem of Packing $r$ -Stars into a Graph without Long Induced Paths