Manuel Bodirsky
Manuel Bodirsky
TU Dresden, Institut für Algebra
Verified email at tu-dresden.de - Homepage
Title
Cited by
Cited by
Year
The complexity of temporal constraint satisfaction problems
M Bodirsky, J Kára
Journal of the ACM (JACM) 57 (2), 1-41, 2010
1532010
Constraint satisfaction with countable homogeneous templates
M Bodirsky, J Nešetřil
Journal of Logic and Computation 16 (3), 359-373, 2006
1172006
Complexity classification in infinite-domain constraint satisfaction
M Bodirsky
arXiv preprint arXiv:1201.0856, 2012
832012
Decidability of definability
M Bodirsky, M Pinsker, T Tsankov
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 321-328, 2011
832011
The core of a countably categorical structure
M Bodirsky
Annual Symposium on Theoretical Aspects of Computer Science, 110-120, 2005
822005
Schaefer's theorem for graphs
M Bodirsky, M Pinsker
Journal of the ACM (JACM) 62 (3), 1-52, 2015
812015
Datalog and constraint satisfaction with infinite templates
M Bodirsky, V Dalmau
Journal of Computer and System Sciences 79 (1), 79-100, 2013
77*2013
Constraint satisfaction problems with infinite templates
M Bodirsky
Complexity of Constraints, 196-228, 2008
772008
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
722007
Reducts of Ramsey structures
M Bodirsky, M Pinsker
AMS Contemporary Mathematics 558, 489-519, 2011
702011
Non-dichotomies in constraint satisfaction complexity
M Bodirsky, M Grohe
International Colloquium on Automata, Languages, and Programming, 184-196, 2008
662008
The complexity of equality constraint languages
M Bodirsky, J Kára
Theory of Computing Systems 43 (2), 136-158, 2008
632008
Topological birkhoff
M Bodirsky, M Pinsker
Transactions of the American Mathematical Society 367 (4), 2527-2549, 2015
542015
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 …, 2009
532009
Random cubic planar graphs
M Bodirsky, M Kang, M Löffler, C McDiarmid
Random structures & algorithms 30 (1‐2), 78-94, 2007
482007
The complexity of surjective homomorphism problems—a survey
M Bodirsky, J Kára, B Martin
Discrete Applied Mathematics 160 (12), 1680-1690, 2012
472012
Constraint satisfaction with infinite domains
M Bodirsky
442005
Generating labeled planar graphs uniformly at random
M Bodirsky, C Gröpl, M Kang
International Colloquium on Automata, Languages, and Programming, 1095-1107, 2003
422003
Constraint satisfaction with countable homogeneous templates
M Bodirsky, J Nešetřil
International Workshop on Computer Science Logic, 44-57, 2003
412003
Boltzmann samplers, Pólya theory, and cycle pointing
M Bodirsky, É Fusy, M Kang, S Vigerske
SIAM Journal on Computing 40 (3), 721-769, 2011
402011
The system can't perform the operation now. Try again later.
Articles 1–20