| A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP M Bodirsky, F Madelaine, A Mottet Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 38 | 2018 |
| A Dichotomy for First-Order Reducts of Unary Structures A Mottet, M Bodirsky Logical Methods in Computer Science 14, 2018 | 35* | 2018 |
| Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction M Bodirsky, A Mottet Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 31 | 2016 |
| Discrete Temporal Constraint Satisfaction Problems M Bodirsky, B Martin, A Mottet Journal of the ACM 65 (2), 2018 | 30 | 2018 |
| Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2019 | 21 | 2019 |
| Constraint satisfaction problems over the integers with successor M Bodirsky, B Martin, A Mottet Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 20 | 2015 |
| Smooth approximations and CSPs over finitely bounded homogeneous structures A Mottet, M Pinsker Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 19 | 2022 |
| The Containment Problem for Unambiguous Register Automata A Mottet, K Quaas STACS 2019, 2019 | 18 | 2019 |
| Omega-categorical structures avoiding height 1 identities M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard Transactions of the American Mathematical Society, 2020 | 16* | 2020 |
| Hrushovski’s Encoding and ω-Categorical CSP Monsters P Gillibert, J Jonušas, M Kompatscher, A Mottet, M Pinsker 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 15 | 2020 |
| A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP M Bodirsky, F Madelaine, A Mottet SIAM Journal on Computing 50 (4), 1359-1409, 2021 | 14 | 2021 |
| Distance constraint satisfaction problems M Bodirsky, V Dalmau, B Martin, A Mottet, M Pinsker Information and Computation 247, 87-105, 2015 | 14 | 2015 |
| When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems P Gillibert, J Jonušas, M Kompatscher, A Mottet, M Pinsker SIAM Journal on Computing 51 (2), 175-213, 2022 | 12 | 2022 |
| Cores over Ramsey structures A Mottet, M Pinsker The Journal of Symbolic Logic 86 (1), 352-361, 2021 | 12 | 2021 |
| Extensions of unification modulo ACUI F Baader, P Marantidis, A Mottet, A Okhotin Mathematical Structures in Computer Science, 1-30, 2019 | 12* | 2019 |
| Smooth approximations and relational width collapses A Mottet, T Nagy, M Pinsker, M Wrona Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021 | 11 | 2021 |
| Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing L Barto, B Bodor, M Kozik, A Mottet, M Pinsker 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023 | 6* | 2023 |
| The complexity of disjunctive linear Diophantine constraints M Bodirsky, B Martin, M Mamino, A Mottet Mathematical Foundations of Computer Science, 2018 | 6 | 2018 |
| Complexity classification transfer for CSPs via algebraic products M Bodirsky, P Jonsson, B Martin, A Mottet, Ž Semanišinová SIAM Journal on Computing 53 (5), 1293-1353, 2024 | 5 | 2024 |
| An order out of nowhere: a new algorithm for infinite-domain CSPs A Mottet, T Nagy, M Pinsker arXiv preprint arXiv:2301.12977, 2023 | 5 | 2023 |
Manuel BodirskyTU Dresden, Institut für AlgebraEmail verificata su tu-dresden.de
