Improved hardness for H-colourings of G-colourable graphs by Wrochna, M, Zivny, S

Treewidth-pliability and PTAS for Max-CSPs by Romero, M, Wrochna, M, Zivny, S

The complexity of promise SAT on non-Boolean domains by Brandts, A, Wrochna, M, Živný, S

PTAS for sparse general-valued CSPs by Mezei, B, Wrochna, M, Živný, S

PTAS for sparse general-valued CSPs by Mezei, BF, Wrochna, M, Živný, S

Pliability and approximating max-CSPs by Romero, M, Wrochna, M, Zivny, S

The complexity of promise SAT on non-Boolean domains by Brandts, A, Wrochna, M, Zivny, S

Topology and adjunction in promise constraint satisfaction by Krokhin, A, Oprsal, J, Wrochna, M, Zivny, S

The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems by Brakensiek, J, Guruswami, V, Wrochna, M, Živný, S