Author of the publication

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.

 

Other publications of authors with the same name

Sparsification of Binary CSPs., and . SIAM J. Discret. Math., 34 (1): 825-842 (2020)The Complexity of Counting Surjective Homomorphisms and Compactions., , and . SIAM J. Discret. Math., 33 (2): 1006-1043 (2019)Discrete Convexity in Joint Winner Property., , and . CoRR, (2017)The Complexity of Valued CSPs., and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection., , , and . STACS, volume 96 of LIPIcs, page 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Treewidth-Pliability and PTAS for Max-CSPs., , and . SODA, page 473-483. SIAM, (2021)PTAS for Sparse General-Valued CSPs., , and . LICS, page 1-11. IEEE, (2021)Minimal Weighted Clones with Boolean Support., , and . ISMVL, page 90-95. IEEE Computer Society, (2016)The Power of Linear Programming for Valued CSPs., and . FOCS, page 669-678. IEEE Computer Society, (2012)A logarithmic approximation of linearly-ordered colourings., , , and . CoRR, (2024)