Some Observations on Minimal Clones. - Hajime Machida; Michael Pinsker (ISMVL, 2006)

Polynomials as Generators of Minimal Clones. - Hajime Machida; Michael Pinsker (ISMVL, 2007)

Some Polynomials Generating Minimal Clones. - Hajime Machida; Michael Pinsker (J. Multiple Valued Log. Soft Comput., 2007)

Monoidal intervals of clones on infinite sets. - Michael Pinsker (Discret. Math., 2008)

Reducts of Ramsey Structures. - Manuel Bodirsky; Michael Pinsker (AMS-ASL Joint Special Session, 2009)

Clones from Ideals. - Mathias Beiglböck; Martin Goldstern; Lutz Heindorf; Michael Pinsker (Int. J. Algebra Comput., 2009)

Distance Constraint Satisfaction Problems. - Manuel Bodirsky; Víctor Dalmau; Barnaby Martin; Michael Pinsker (MFCS, 2010)

The reducts of equality up to primitive positive interdefinability. - Manuel Bodirsky; Hubie Chen; Michael Pinsker (J. Symb. Log., 2010)

More Sublattices of the Lattice of Local Clones. - Michael Pinsker (Order, 2010)

Topological Birkhoff - Manuel Bodirsky; Michael Pinsker (CoRR, 2012)

Reconstructing the topology of clones. - Manuel Bodirsky; Michael Pinsker; András Pongrácz (CoRR, 2013)

A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone. - Martin Goldstern; Michael Pinsker; Saharon Shelah (Int. J. Algebra Comput., 2013)

A new operation on partially ordered sets. - Péter Pál Pach; Michael Pinsker; András Pongrácz; Csaba A. Szabó (J. Comb. Theory A, 2013)

Decidability of definability. - Manuel Bodirsky; Michael Pinsker; Todor Tsankov (J. Symb. Log., 2013)

Permutations on the Random Permutation. - Julie Linman; Michael Pinsker (Electron. J. Comb., 2015)

The wonderland of reflections. - Libor Barto; Jakub Oprsal; Michael Pinsker (CoRR, 2015)

Algebraic and model theoretic methods in constraint satisfaction. - Michael Pinsker (CoRR, 2015)

Schaefer's Theorem for Graphs. - Manuel Bodirsky; Michael Pinsker (J. ACM, 2015)

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. - Libor Barto; Michael Pinsker (LICS, 2016)

Distance constraint satisfaction problems. - Manuel Bodirsky; Víctor Dalmau; Barnaby Martin; Antoine Mottet; Michael Pinsker (Inf. Comput., 2016)

The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. - Libor Barto; Michael Kompatscher; Miroslav Olsák; Trung Van Pham; Michael Pinsker (LICS, 2017)

Pseudo-loop conditions. - Pierre Gillibert; Julius Jonusas; Michael Pinsker (CoRR, 2018)

The universal homogeneous binary tree. - Manuel Bodirsky; David Bradley-Williams; Michael Pinsker; András Pongrácz (J. Log. Comput., 2018)

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). - Manuel Bodirsky; Antoine Mottet; Miroslav Olsák; Jakub Oprsal; Michael Pinsker; Ross Willard (LICS, 2019)

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). - Manuel Bodirsky; Antoine Mottet; Miroslav Olsák; Jakub Oprsal; Michael Pinsker; Ross Willard (CoRR, 2019)

Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. - Libor Barto; Michael Kompatscher; Miroslav Olsák; Van Trung Pham; Michael Pinsker (J. Math. Log., 2019)

Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. - Manuel Bodirsky; Barnaby Martin; Michael Pinsker; András Pongrácz (SIAM J. Comput., 2019)

Hrushovski's Encoding and ω-Categorical CSP Monsters. - Pierre Gillibert; Julius Jonusas; Michael Kompatscher; Antoine Mottet; Michael Pinsker (ICALP, 2020)

ω-categorical structures avoiding height 1 identities. - Manuel Bodirsky; Antoine Mottet; Miroslav Olsák; Jakub Oprsal; Michael Pinsker; Ross Willard (CoRR, 2020)

Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems). - Libor Barto; Michael Pinsker (SIAM J. Comput., 2020)

Smooth Approximations and Relational Width Collapses. - Antoine Mottet; Tomás Nagy; Michael Pinsker; Michal Wrona (ICALP, 2021)

Canonical functions: a proof via topological dynamics. - Michael Pinsker; Manuel Bodirsky (Contributions Discret. Math., 2021)

Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. - Libor Barto; Michael Kompatscher; Miroslav Olsák; Trung Van Pham; Michael Pinsker (J. Math. Log., 2021)

Projective clone Homomorphisms. - Manuel Bodirsky; Michael Pinsker; András Pongrácz (J. Symb. Log., 2021)

Cores over Ramsey Structures. - Antoine Mottet; Michael Pinsker (J. Symb. Log., 2021)

Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. - Michael Pinsker (ISMVL, 2022)

Smooth approximations and CSPs over finitely bounded homogeneous structures. - Antoine Mottet; Michael Pinsker (LICS, 2022)

When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. - Pierre Gillibert; Julius Jonusas; Michael Kompatscher; Antoine Mottet; Michael Pinsker (SIAM J. Comput., 2022)

Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. - Libor Barto; Bertalan Bodor; Marcin Kozik; Antoine Mottet; Michael Pinsker (LICS, 2023)

An order out of nowhere: a new algorithm for infinite-domain CSPs. - Antoine Mottet; Michael Pinsker; Tomás Nagy (CoRR, 2023)

Symmetries of structures that fail to interpret something finite. - Libor Barto; Bertalan Bodor; Marcin Kozik; Antoine Mottet; Michael Pinsker (CoRR, 2023)

An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. - Antoine Mottet; Tomás Nagy; Michael Pinsker (ICALP, 2024)

Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality. - Tomás Nagy; Michael Pinsker (CoRR, 2024)

An algebraic proof of the graph orientation problem dichotomy for forbidden tournaments. - Roman Feller; Michael Pinsker (CoRR, 2024)

Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough. - Antoine Mottet; Tomás Nagy; Michael Pinsker; Michal Wrona (SIAM J. Comput., 2024)

Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures. - Antoine Mottet; Michael Pinsker (J. ACM, 2024)

Containment for Guarded Monotone Strict NP. - Alexey Barsukov; Michael Pinsker; Jakub Rydval (ICALP, 2025)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction. - Michael Pinsker; Jakub Rydval; Moritz Schöbi; Christoph Spiess (MFCS, 2025)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. - Johanna Brunar; Marcin Kozik; Tomás Nagy; Michael Pinsker (CoRR, 2025)

New Sufficient Algebraic Conditions for Local Consistency over Homogeneous Structures of Finite Duality. - Tomás Nagy; Michael Pinsker; Michal Wrona (CoRR, 2025)

Three meta-questions on infinite-domain Constraint Satisfaction Problems. - Michael Pinsker; Jakub Rydval; Moritz Schöbi; Christoph Spiess (CoRR, 2025)