4 citations · 5 across the 2 of their papers we have counts for
1 paper · 1 filter
Falko Hegerfeld, Stefan Kratsch
Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems adm…