“…Such algorithms have been found for many combinatorial problems (see e.g., [8,9,33,94,138,144]), and also have been employed for problems from computational biology (see e.g., [100]), constraint satisfaction (see e.g., [40,47,78,94]), and probabilistic networks (see [99]). See e.g., also [3,2,6,12,32,39,38,42,50,70,79,80,82,85,88,106,105,108,145]. In other words: many graph problems become fixed-parameter tractable when parameterized by the treewidth of the input graph.…”