3 papers
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…
math.CO2026
A polynomial bound on the pathwidth of graphs edge-coverable by shortest paths
Julien Baste, Lucas De Meyer, Ugo Giocanti +2
Dumas, Foucaud, Perez and Todinca (2024) recently proved that every graph whose edges can be covered by shortest paths has pathwidth at most . In this paper, we improve…
cs.DS2026
The Leafed Induced Subtree in chordal and bounded treewidth graphs
Julien Baste
In the Fully Leafed Induced Subtrees, one is given a graph and two integers and and the question is to find an induced subtree of with vertices and at least …