Julien Baste

activity

20162026

most citedFPT Algorithms for Diverse Collections of Hitting Sets

13 citations · 15 across the 12 of their papers we have counts for

collaborators

Showing 2017 · cs.DSShow all

3 papers · 2 filters

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…

cs.DS2017

Hitting minors on bounded treewidth graphs. I. General upper bounds

Julien Baste, Ignasi Sau, Dimitrios M. Thilikos

For a finite collection of graphs $F$ , the $F$ -M-DELETION problem consists in, given a graph $G$ and an integer $k$ , deciding whether there exists $S \subseteq V (G)$ …

cs.DS2017

Ruling out FPT algorithms for Weighted Coloring on forests

Júlio Araújo, Julien Baste, Ignasi Sau

Given a graph $G$ , a proper $k$ -coloring of $G$ is a partition $c = (S_{i})_{i \in [1, k]}$ of $V (G)$ into $k$ stable sets $S_{1}, \dots, S_{k}$ . Given a weight function $w: V(G) \to \ma…