P. Bonsma

activity

20072015

most citedAn FPT Algorithm for Directed Spanning k-Leaf

16 citations · 52 across the 11 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2014★ 7 cited

The Complexity of Bounded Length Graph Recoloring

Paul Bonsma, Amer E. Mouawad

We study the following question: Given are two $k$ -colorings $α$ and $β$ of a graph $G$ on $n$ vertices, and integer $ℓ$ . The question is whether $α$ can be modified into $β$ , b…

cs.CC2010★ 2 cited

The Complexity of Rerouting Shortest Paths

Paul Bonsma

The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there ex…