( en | de | ru )

 

Disambiguation of "Zivný, Stanislav"

Author of the publication

copydeleteadd this publication to your clipboard
On planar valued CSPs.

, and . J. Comput. Syst. Sci., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stanislav Zivny

Stanislav Laznicka

Stanislav Novak

Stanislav Pandelov

Stanislav Nastassine

 

Other publications of authors with the same name

Binarisation for Valued Constraint Satisfaction Problems., , , , , and . SIAM J. Discret. Math., 31 (4): 2279-2300 (2017)A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP., , and . CP, volume 7514 of Lecture Notes in Computer Science, page 265-273. Springer, (2012)Sparsification of Binary CSPs., and . STACS, volume 126 of LIPIcs, page 17:1-17:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection., , , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 231-242. Springer, (2011)On planar valued CSPs., and . J. Comput. Syst. Sci., (2017)Functional Clones and Expressibility of Partition Functions., , , , and . CoRR, (2016)Hybrid Tractable Classes of Constraint Problems., and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Complexity of Valued Constraint Satisfaction Problems. Cognitive Technologies Springer, (2012)A tractable class of binary VCSPs via M-convex intersection., , , and . CoRR, (2018)PTAS for Sparse General-Valued CSPs., , and . CoRR, (2020)