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

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

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

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

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

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

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