Author of the publication

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.

, , , , , , and . LATIN (2), volume 14579 of Lecture Notes in Computer Science, page 223-237. Springer, (2024)

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

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!, , , and . ITCS, volume 185 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage., , , , , , and . SODA, page 3713-3733. SIAM, (2023)Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints., , , , , and . ICALP, volume 297 of LIPIcs, page 88:1-88:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses., , , , , , and . LATIN (2), volume 14579 of Lecture Notes in Computer Science, page 223-237. Springer, (2024)