Friedrich, Tobias Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Hermelin, Danny Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Fellows, M. R., Friedrich, T., Hermelin, D., Narodytska, N., & Rosamond, F. A. (2011). Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 522-527). Menlo Park, CA: AAAI Press. doi:10.5591/978-1-57735-516-8/IJCAI11-095.
