114 citations · 306 across the 50 of their papers we have counts for
1 paper · 2 filters
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…