Graph separation is a well-known tool to make (hard) graph problems accessible to a divide and conquer approach. We show how to use graph separator theorems in combination with (linear) problem kernels in order to develop ...

Maximization problems are usually considered as parameterized problems taking as parameter the entity which has to be maximized. In contrast, we study here another parameterization, given by the dual bounding constant in ...