29 citations · 48 across the 20 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DM2026
Zero Forcing Sets in Temporal Graphs
Julien Baste, Simon Dreyer, Clara Marcille +2
The Zero Forcing (or corruption) of a graph is the problem of finding a minimum-size ``corrupting'' set. It corresponds to a subset of its vertices that can corrupt the whole graph…
cs.DS2026
On the diversity problems parameterized by the size of the solutions
Julien Baste, Cléophée Robin, Marie-Emilie Voge
Diversity optimization seeks multiple high-quality solutions that are sufficiently different from one another, providing a richer representation of the solution space than a single…