1. Charikar M, Guruswami V, Manokaran R (2009) Every permutation CSP of arity 3 is approximation resistant. In: Computational complexity 2009, Paris, pp 62–73
2. Gutin G, Kim EJ, Mnich M, Yeo A (2010) Betweenness parameterized above tight lower bound. J Comput Syst Sci 76:872–878
3. Gutin G, Kim EJ, Szeider S, Yeo A (2011) A probabilistic approach to problems parameterized above tight lower bound. J Comput Syst Sci 77:422–429
4. Gutin G, van Iersel L, Mnich M, Yeo A (2012) All ternary permutation constraint satisfaction problems parameterized above average have Kernels with quadratic number of variables. J Comput Syst Sci 78:151–163
5. Guttmann W, Maucher M (2006) Variations on an ordering theme with constraints. In: 4th IFIP international conference on theoretical computer science-TCS 2006, Santiago. Springer, pp 77–90