Name
Papers
Collaborators
MANUEL BODIRSKY
93
67
Citations 
PageRank 
Referers 
644
54.63
426
Referees 
References 
596
1038
Search Limit
100596
Title
Citations
PageRank
Year
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation00.342022
Network Satisfaction For Symmetric Relation Algebras With A Flexible Atom00.342021
A Proof Of The Algebraic Tractability Conjecture For Monotone Monadic Snp10.352021
Canonical functions: a proof via topological dynamics.00.342021
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property10.352021
Tractable Combinations of Theories via Sampling00.342021
Datalog-Expressibility for Monadic and Guarded Second-Order Logic00.342021
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems.00.342020
Hardness of Network Satisfaction for Relation Algebras with Normal Representations.00.342020
Temporal Constraint Satisfaction Problems in Fixed-Point Logic00.342020
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).00.342019
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)00.342019
A polynomial-time algorithm for median-closed semilinear constraints.00.342018
A Dichotomy for First-Order Reducts of Unary Structures.10.352018
Tropically Convex Constraint Satisfaction.10.372018
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains.00.342018
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.10.352018
Complexity of Combinations of Qualitative Constraint Satisfaction Problems.00.342018
Classification transfer for qualitative reasoning problems.00.342018
The complexity of disjunctive linear Diophantine constraints.00.342018
Finite Relation Algebras with Normal Representations.00.342018
Classification Transfer for Qualitative Reasoning Problems.00.342018
Constraint Satisfaction Problems over Numeric Domains.00.342017
The Complexity of Phylogeny Constraint Satisfaction Problems.40.402017
A Model-Theoretic View on Qualitative Constraint Reasoning.50.412017
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.60.452016
The Reducts of the homogeneous Binary Branching C-Relation.10.352016
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs20.382016
Canonical Functions: A Proof Via Topological Dynamics10.352016
Distance constraint satisfaction problems.00.342016
The Complexity of Constraint Satisfaction Problems (Invited Talk).10.362015
Max-Closed Semilinear Constraint Satisfaction00.342015
The Complexity of Phylogeny Constraint Satisfaction.60.472015
New Ramsey Classes from Old.20.512014
Tractability Of Quantified Temporal Constraints To The Max00.342014
THE UNIVERSAL HOMOGENEOUS BINARY TREE20.482014
Projective Clone Homomorphisms110.602014
Reconstructing the topology of clones20.412013
Complexity of Existential Positive First-Order Logic30.482013
Topological Birkhoff00.342012
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction.40.442012
On the Complexity of MMSNP60.422012
Complexity Classification in Infinite-Domain Constraint Satisfaction220.852012
The complexity of surjective homomorphism problems-a survey160.712012
Essential Convexity and Complexity of Semi-Algebraic Constraints421.612012
Equivalence Constraint Satisfaction Problems.30.402012
RCC8 is polynomial on networks of bounded treewidth120.632011
Decidability of definability.140.792011
Schaefer's theorem for graphs140.832011
Tractable Set Constraints10.362011
  • 1
  • 2