The following pages link to Manuel Bodirsky (Q259042):
Displaying 50 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- New Ramsey classes from old (Q405215) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- \({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations (Q535102) (← links)
- The complexity of equality constraint languages (Q929295) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- Oligomorphic clones (Q995385) (← links)
- Enumeration and asymptotic properties of unlabeled outerplanar graphs (Q1010626) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Peek arc consistency (Q1044838) (← links)
- Finite relation algebras with normal representations (Q1617803) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- A counterexample to the reconstruction of \(\omega\)-categorical structures from their endomorphism monoid (Q1650007) (← links)
- Complexity of combinations of qualitative constraint satisfaction problems (Q1799088) (← links)
- Datalog and constraint satisfaction with infinite templates (Q1936249) (← links)
- Minimal functions on the random graph (Q2017162) (← links)
- Permutation groups with small orbit growth (Q2037519) (← links)
- Tractable combinations of theories via sampling (Q2055788) (← links)
- Piecewise linear valued constraint satisfaction problems with fixed number of variables (Q2056915) (← links)
- ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
- Two-element structures modulo primitive positive constructability (Q2310436) (← links)
- A topological characterisation of endomorphism monoids of countable structures (Q2359730) (← links)
- Generating labeled planar graphs uniformly at random (Q2373725) (← links)
- Enumeration and limit laws for series-parallel graphs (Q2461767) (← links)
- A direct decomposition of 3-connected planar graphs (Q2654584) (← links)
- (Q2778869) (← links)
- Schaefer's theorem for graphs (Q2796406) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction (Q2893326) (← links)
- On the complexity of MMSNP (Q2902910) (← links)
- On the scope of the universal-algebraic approach to constraint satisfaction (Q2914234) (← links)
- (Q2934614) (← links)
- A fast algorithm and datalog inexpressibility for temporal reasoning (Q2946603) (← links)
- Constraint satisfaction tractability from semi-lattice operations on infinite sets (Q2946719) (← links)
- The 42 reducts of the random ordered graph (Q2949677) (← links)
- The Complexity of Constraint Satisfaction Problems (Invited Talk) (Q2954979) (← links)
- Reconstructing the topology of clones (Q2960444) (← links)
- A Model-Theoretic View on Qualitative Constraint Reasoning (Q2974510) (← links)
- THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING <i>C</i>-RELATION (Q2976332) (← links)
- REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS (Q2976381) (← links)
- The reducts of equality up to primitive positive interdefinability (Q3066793) (← links)
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing (Q3093621) (← links)
- Limit Behavior of Locally Consistent Constraint Satisfaction Problems (Q3094950) (← links)
- Reducts of Ramsey structures (Q3118392) (← links)
- Essential Convexity and Complexity of Semi-Algebraic Constraints (Q3166226) (← links)
- Ramsey classes: examples and constructions (Q3179071) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- Complexity of Infinite-Domain Constraint Satisfaction (Q3388253) (← links)
