54 citations · 62 across the 10 of their papers we have counts for
1 paper · 1 filter
Frank Kammer, Torsten Tholey
Many algorithms have been developed for NP-hard problems on graphs with small treewidth k. For example, all problems that are expressable in linear extended monadic second order…