The complexity and expressive power of valued constraints by Zivny, S

The complexity of valued constraint satisfaction problems by Živný, S

Structural properties of oracle classes by Živný, S

Relation between accepting languages and complexity of questions on oracle by Živný, S

Properties of oracle classes that collapse or separate complexity classes by Živný, S

The Complexity and Expressive Power of Valued Constraints by Živný, S

Sparsification of binary CSPs by Butti, S, Zivny, S

A strongly polynomial-time algorithm for weighted general factors with three feasible degrees by Shao, S, Zivny, S

Sparsification of Binary CSPs by Butti, S, Zivny, S

Which submodular functions are expressible using binary submodular functions? by Živný, S, Jeavons, P

The Power of Linear Programming for Valued CSPs by Thapper, J, Zivny, S

The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains by Viola, C, Zivny, S

Classes of submodular constraints expressible by graph cuts. by Zivny, S, Jeavons, P

Tractable triangles by Cooper, M, Živný, S

The power of Sherali-Adams relaxations for general-valued CSPs by Thapper, J, Zivny, S

The power of linear programming for valued CSPs by Thapper, J, Živný, S

Approximate counting CSP seen from the other side by Bulatov, A, Živný, S

Boolean symmetric vs. functional PCSP dichotomy by Nakajima, T-V, Živný, S

Classes of submodular constraints expressible by graph cuts by Zivny, S, Jeavons, P

On minimal weighted clones by Creed, P, Živný, S