1 citations · 1 across the 3 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DM2026
Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers
Li-Hsuan Chen, Florent Foucaud, Ling-Ju Hung +3
We study how covering a graph by a small number of shortest or approximately shortest paths/walks constrains its treewidth and pathwidth. A path or walk is -quasi-shortest f…
cs.DS2026
On the Impact of Stability and the Helly Property on the Dominating Set Problem
Che Cheng, Daniel Mock, Peter Rossmanith
We extend the algorithmic framework of progressive exploration [Fabiański et al., STACS 2019], which yields simple, yet surprisingly general and efficient parameterized algorithms…