Manuel Bodirsky - Google Scholar

Cited by

	All	Since 2015
Citations	2547	1389
h-index	29	21
i10-index	69	45

300

150

225

20032004200520062007200820092010201120122013201420152016201720182019202015 13 51 69 129 88 86 120 83 175 111 146 238 232 212 292 212 195

Co-authors

Michael PinskerTechnische Universität WienVerified email at tuwien.ac.at
Mihyun KangProfessor, Graz University of TechnologyVerified email at math.tugraz.at
Peter JonssonProfessor in Computer Science, Linköping UniversityVerified email at liu.se
Antoine MottetCharles University in PragueVerified email at karlin.mff.cuni.cz
Timo von OertzenProfessor of Quantitative Psychology, University of the Federal Forces, MunichVerified email at unibw.de
András PongráczSenior assistant professor, University of DebrecenVerified email at science.unideb.hu
Stefan VigerskeGAMS Software GmbH, Zuse Institute BerlinVerified email at gams.com
Marc NoyProfessor of Mathematics, Universitat Politècnica de CatalunyaVerified email at upc.edu
Joachim NiehrenINRIA LilleVerified email at inria.fr
Victor DalmauDepartment of Information and Communication Technologies, Universitat Pompeu FabraVerified email at upf.edu
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Marco KuhlmannLinköping UniversityVerified email at liu.se
Alexander KollerProfessor of Computational Linguistics, Saarland UniversityVerified email at coli.uni-saarland.de
Ross WillardPure Mathematics, University of WaterlooVerified email at uwaterloo.ca
Jakub OpršalDurham UniversityVerified email at durham.ac.uk
Stefan WölflVerified email at informatik.uni-freiburg.de
Michael KompatscherDepartment of Algebra, Charles UniversityVerified email at logic.at
David EvansProfessor of Pure Mathematics, Imperial College LondonVerified email at imperial.ac.uk
Johan ThapperUniversité Paris-Est, Marne-la-ValléeVerified email at u-pem.fr

Manuel Bodirsky

TU Dresden, Institut für Algebra

Verified email at tu-dresden.de - Homepage

Model Theory Finite Model Theory Universal Algebra Ramsey Theory Theoretical Computer Science


Title Sort by citations Sort by year Sort by 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	152	2010
Constraint satisfaction with countable homogeneous templates M Bodirsky, J Nešetřil Journal of Logic and Computation 16 (3), 359-373, 2006	115	2006
Complexity classification in infinite-domain constraint satisfaction M Bodirsky arXiv preprint arXiv:1201.0856, 2012	82	2012
Decidability of definability M Bodirsky, M Pinsker, T Tsankov 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 321-328, 2011	82	2011
Schaefer's theorem for graphs M Bodirsky, M Pinsker Journal of the ACM (JACM) 62 (3), 1-52, 2015	80	2015
The core of a countably categorical structure M Bodirsky Annual Symposium on Theoretical Aspects of Computer Science, 110-120, 2005	80	2005
Datalog and constraint satisfaction with infinite templates M Bodirsky, V Dalmau Journal of Computer and System Sciences 79 (1), 79-100, 2013	75*	2013
Constraint satisfaction problems with infinite templates M Bodirsky Complexity of Constraints, 196-228, 2008	75	2008
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	70	2007
Reducts of Ramsey structures M Bodirsky, M Pinsker AMS Contemporary Mathematics 558, 489-519, 2011	68	2011
Non-dichotomies in constraint satisfaction complexity M Bodirsky, M Grohe International Colloquium on Automata, Languages, and Programming, 184-196, 2008	64	2008
The complexity of equality constraint languages M Bodirsky, J Kára Theory of Computing Systems 43 (2), 136-158, 2008	61	2008
Topological birkhoff M Bodirsky, M Pinsker Transactions of the American Mathematical Society 367 (4), 2527-2549, 2015	53	2015
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	53	2009
Random cubic planar graphs M Bodirsky, M Kang, M Löffler, C McDiarmid Random structures & algorithms 30 (1‐2), 78-94, 2007	48	2007
The complexity of surjective homomorphism problems—a survey M Bodirsky, J Kára, B Martin Discrete Applied Mathematics 160 (12), 1680-1690, 2012	47	2012
Constraint satisfaction with infinite domains M Bodirsky	44	2005
Generating labeled planar graphs uniformly at random M Bodirsky, C Gröpl, M Kang International Colloquium on Automata, Languages, and Programming, 1095-1107, 2003	42	2003
Constraint satisfaction with countable homogeneous templates M Bodirsky, J Nešetřil International Workshop on Computer Science Logic, 44-57, 2003	41	2003
Boltzmann samplers, Pólya theory, and cycle pointing M Bodirsky, É Fusy, M Kang, S Vigerske SIAM Journal on Computing 40 (3), 721-769, 2011	40	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors