The complexity of temporal constraint satisfaction problems M Bodirsky, J Kára Journal of the ACM (JACM) 57 (2), 1-41, 2010 | 205 | 2010 |
Constraint satisfaction with countable homogeneous templates M Bodirsky, J Nešetřil Journal of Logic and Computation 16 (3), 359-373, 2006 | 141 | 2006 |
Schaefer's theorem for graphs M Bodirsky, M Pinsker Journal of the ACM (JACM) 62 (3), 1-52, 2015 | 108 | 2015 |
Decidability of definability M Bodirsky, M Pinsker, T Tsankov The Journal of Symbolic Logic 78 (4), 1036-1054, 2013 | 108 | 2013 |
Complexity classification in infinite-domain constraint satisfaction M Bodirsky arXiv preprint arXiv:1201.0856, 2012 | 106 | 2012 |
Enumeration and limit laws for series–parallel graphs M Bodirsky, O Giménez, M Kang, M Noy European Journal of Combinatorics 28 (8), 2091-2105, 2007 | 106 | 2007 |
Cores of countably categorical structures M Bodirsky Logical Methods in Computer Science 3, 2007 | 103 | 2007 |
Datalog and constraint satisfaction with infinite templates M Bodirsky, V Dalmau Journal of Computer and System Sciences 79 (1), 79-100, 2013 | 97* | 2013 |
Non-dichotomies in constraint satisfaction complexity M Bodirsky, M Grohe Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 93 | 2008 |
The complexity of equality constraint languages M Bodirsky, J Kára Theory of Computing Systems 43, 136-158, 2008 | 92 | 2008 |
Reducts of Ramsey structures M Bodirsky, M Pinsker AMS Contemporary Mathematics 558, 489-519, 2011 | 79 | 2011 |
Boltzmann samplers, Pólya theory, and cycle pointing M Bodirsky, É Fusy, M Kang, S Vigerske SIAM Journal on Computing 40 (3), 721-769, 2011 | 79* | 2011 |
Constraint satisfaction problems with infinite templates M Bodirsky Complexity of Constraints: An Overview of Current Research Themes, 196-228, 2008 | 75 | 2008 |
Topological birkhoff M Bodirsky, M Pinsker Transactions of the American Mathematical Society 367 (4), 2527-2549, 2015 | 73 | 2015 |
The complexity of surjective homomorphism problems—a survey M Bodirsky, J Kára, B Martin Discrete Applied Mathematics 160 (12), 1680-1690, 2012 | 68 | 2012 |
Well-nested drawings as models of syntactic structure M Bodirsky, M Kuhlmann, M Möhl Tenth Conference on Formal Grammar and Ninth Meeting on Mathematics of …, 2005 | 66 | 2005 |
Projective clone homomorphisms M Bodirsky, M Pinsker, A Pongrácz The Journal of Symbolic Logic 86 (1), 148-161, 2021 | 64 | 2021 |
Complexity of infinite-domain constraint satisfaction M Bodirsky Cambridge University Press, 2021 | 62 | 2021 |
Ramsey classes: examples and constructions. M Bodirsky Surveys in combinatorics 424, 1, 2015 | 59 | 2015 |
Random cubic planar graphs M Bodirsky, M Kang, M Löffler, C McDiarmid Random Structures & Algorithms 30 (1‐2), 78-94, 2007 | 59 | 2007 |