Friedrich, Tobias Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Hermelin, Danny Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Fellows, M., Friedrich, T., Hermelin, D., Nardodytska, N., & Rosamond, F. (2013). Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. Theoretical Computer Science, 472, 81-89. doi:10.1016/j.tcs.2012.11.038.