Najnowsze publikacje

• Brunar Johanna, Marcin Kozik, Tomáš Nagy, Michael Pinsker, The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems, IEEE Symposium on Logic in Computer Science [LICS], (2025),
• Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona, Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough, SIAM Journal on Computing 53 (2024), 1709-1745
• Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona, Smooth Approximations and Relational Width Collapses, International Colloquium on Automata Languages and Programming [ICALP] LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 (2021), 138:1-138:20