30 citations · 157 across the 83 of their papers we have counts for
1 paper · 2 filters
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh +1
We give the first linear kernels for the (Connected) Dominating Set problems on H-topological minor free graphs. We prove the existence of polynomial time algorithms that, for a gi…