Abu-Khzam, Faisal N.; Markarian, Christine; Podipyan, Pavel
(Springer, 2018-04-23)
Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become ...