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]

@article{GutinIMY12,
  title = {Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables},
  author = {Gregory Gutin and Leo van Iersel and Matthias Mnich and Anders Yeo},
  year = {2012},
  doi = {10.1016/j.jcss.2011.01.004},
  url = {http://dx.doi.org/10.1016/j.jcss.2011.01.004},
  researchr = {https://researchr.org/publication/GutinIMY12},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {78},
  number = {1},
  pages = {151-163},
}