Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo. Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci., 78(1):151-163, 2012. [doi]

Authors

Gregory Gutin

This author has not been identified. Look up 'Gregory Gutin' in Google

Leo van Iersel

This author has not been identified. Look up 'Leo van Iersel' in Google

Matthias Mnich

This author has not been identified. Look up 'Matthias Mnich' in Google

Anders Yeo

This author has not been identified. Look up 'Anders Yeo' in Google