66 citations · 206 across the 36 of their papers we have counts for
3 papers · 1 filter
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
Serge Gaspers, Mathieu Liedloff
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two…
Parameterizing by the Number of Numbers
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a nove…
Complexity of Splits Reconstruction for Low-Degree Trees
Serge Gaspers, Mathieu Liedloff, Maya Stein +1
Given a vertex-weighted tree T, the split of an edge xy in T is min{s_x(xy), s_y(xy)} where s_u(uv) is the sum of all weights of vertices that are closer to u than to v in T. Given…