Author of the publication

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees.

, and . ISAAC, volume 283 of LIPIcs, page 57:1-57:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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)Discrete Convexity in Joint Winner Property., , and . CoRR, (2017)The Complexity of Counting Surjective Homomorphisms and Compactions., , and . SIAM J. Discret. Math., 33 (2): 1006-1043 (2019)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)QCSP on Reflexive Tournaments., , , , , and . ESA, volume 204 of LIPIcs, page 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Linearly Ordered Colourings of Hypergraphs., and . ICALP, volume 229 of LIPIcs, page 128:1-128:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Beyond PCSP(1-in-3, NAE)., and . ICALP, volume 198 of LIPIcs, page 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)