- parameterized (in)approximability results; - relationships between parameterized complexity and traditional complexity classifications; - applications of parameterized and exact computation; - engineering and experimentation of exact, parameterized, and kernelization algorithms. The full paper submission deadli...
The main idea of the kernelization is to find opportunities to merge monochromatic parts of U or to transform distinct clusters into a single cluster because we infer that they form a larger monochromatic set. Intuitively, an opportunity for merging arises when there are many vertices in V∖U...