Skip to main content

2 Result(s)

within William Lochet Remove this filter

and

  1. Article

    Open Access

    Parameterized Complexity of Directed Spanner Problems

    We initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the...

    Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra… in Algorithmica (2022)

    Download PDF (384 KB) View Article

  2. No Access

    Article

    Packing and Covering Balls in Graphs Excluding a Minor

    We prove that for every integer t ⩾ 1 there exists a constant ct such that for every Kt-minor-free graph G, and every set S of balls in G, the minimum size of a set of vertices of G intersecting all the balls of

    Nicolas Bousquet, Wouter Cames Van Batenburg, Louis Esperet, Gwenaël Joret… in Combinatorica (2021)