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

1 paper · 1 filter

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…

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

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