23 citations · 76 across the 30 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
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 and , at least one of the arcs and is present. We study the complexity of computing two layo…
cs.DS2017
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste, Didem Gözüpek, Christophe Paul +3
We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirect…