Machine learning, constraint satisfaction problem, soft versions of CSP, minimum cost homomorphism problem, dichotomy conjecture, markov random fields, protein conformation prediction, syntactic pattern recognition.

1. Takhanov R. S., “A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem”, 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Leibniz International Proceedings in Informatics (LIPIcs), 5, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, 2010, 657–668
2. Takhanov R. S., “Extensions of the minimum cost homomorphism problem”, Computing and Combinatorics, 16th Annual International Conference (COCOON), Lecture Notes in Computer Science (LNCS), 6196, Springer, 2010, 328–337
3. Rustem Takhanov, Vladimir Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data”, Proceedings of The 30th International Conference on Machine Learning, 28(3), 2013, 145–153
4. Vladimir Kolmogorov, Rustem Takhanov, Michal Rolinek, “Effectiveness of Structural Restrictions for Hybrid CSPs”, Proceedings of The 26th International Symposium on Algorithms and Computation, 2015, 566-577
5. Rustem Takhanov, “Hybrid VCSPs with Crisp and Valued Conservative Templates”, Proceedings of The 28th International Symposium on Algorithms and Computation, 2017, 65:1–65:13

• Nazarbayev University Research and Innovation System
• Institute of Science and Technology Austria
• Dorodnitsyn Computing Centre of the Russian Academy of Sciences, Moscow
• Linköping University