Manuel Bodirsky - Concepedia

Author

Manuel Bodirsky

Laboratoire d'Informatique de l'École Polytechnique ORCID

Also Known As

Bodirsky M., Bodirsky, Manuel, Horcik, Rostislav, Horcík, Rostislav, M. Bodirsky, MANUEL BODIRSKY, Manuel Bodirsky, Manuel, Bodirsky, Osipov, George, Pinsker, Michael

239

Publications

2.4K

Citations

H-Index

Concepts

All Affiliations

Laboratoire d'Informatique de l'École Polytechnique Centre National de la Recherche Scientifique Humboldt-Universität zu Berlin Technische Universität Dresden Charles University

About

Manuel Bodirsky is an author at Laboratoire d'Informatique de l'École Polytechnique specializing in engineering, formal methods, and automated reasoning.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	22	35	1.3K
2	Education	5	5	179
3	Natural Sciences	2	2	61
4	Business	1	1	24
5	Language Studies	1	1	15

Manuel Bodirsky

Publications

1.5K

Citations

H-Index

Page 1

	Year	Citations
The complexity of temporal constraint satisfaction problems Manuel Bodirsky, Jan Kára Journal of the ACM Mathematical ProgrammingConstraint SolvingEngineeringConstraint SatisfactionParameterized Complexity	2010	147
Constraint Satisfaction with Countable Homogeneous Templates Manuel Bodirsky, Jaroslav Nešetřil Journal of Logic and Computation Constraint SolvingEngineeringConstraint SatisfactionComputability TheoryAutomated Reasoning	2006	103
Enumeration and limit laws for series–parallel graphs Manuel Bodirsky, Omer Giménez, Mihyun Kang, European Journal of Combinatorics Network ScienceGraph TheoryEngineeringAlgebraic Graph TheoryStructural Graph Theory	2007	87
The Complexity of Equality Constraint Languages Manuel Bodirsky, Jan Kára Theory of Computing Systems Constraint SolvingEngineeringConstraint SatisfactionAutomated ReasoningFormal Methods	2007	77
Essential Convexity and Complexity of Semi-Algebraic Constraints Manuel Bodirsky, Peter Jönsson, Timo von Oertzen Logical Methods in Computer Science Mathematical ProgrammingEngineeringLine SegmentComputational ComplexitySemidefinite Programming	2012	72
The complexity of surjective homomorphism problems—a survey Manuel Bodirsky, Jan Kára, Barnaby Martin Discrete Applied Mathematics Computational Complexity TheoryEngineeringParameterized ComplexityComputational ComplexityTime Complexity	2012	62
The reducts of equality up to primitive positive interdefinability Manuel Bodirsky, Hubie Chen, Michael Pinsker Journal of Symbolic Logic Algebraic LogicEngineeringDomain TheorySubstructural LogicRelational Structures	2010	51
Decidability of Definability Manuel Bodirsky, Michael Pinsker, Todor Tsankov Journal of Symbolic Logic EngineeringUniversal QuantificationInfinite Structure γAutomated ReasoningVerification	2013	50
Schaefer's Theorem for Graphs Manuel Bodirsky, Michael Pinsker Journal of the ACM Boolean LogicEngineeringGraph TheoryAlgebraic Graph TheoryAutomated Reasoning	2015	49
Well-Nested Drawings as Models of Syntactic Structure ? Manuel Bodirsky, Marco Kuhlmann	2005	43

Page 1