Computing the tree-partition-width of a graph exactly is XALP-complete, even when using the target width and maximum degree as combined parameter.
