Author of the publication

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)

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

A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , and . Algorithmica, 84 (11): 3246-3275 (2022)Parameterized complexity of perfectly matched sets., , , and . Theor. Comput. Sci., (May 2023)Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , and . SIAM J. Discret. Math., 37 (4): 2626-2669 (December 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)Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage., , , , , , and . SODA, page 3713-3733. SIAM, (2023)Conflict and Fairness in Resource Allocation., , , , , , and . CoRR, (2024)Partitioning Subclasses of Chordal Graphs with Few Deletions., , , , and . CIAC, volume 13898 of Lecture Notes in Computer Science, page 293-307. Springer, (2023)Mixed Dominating Set: A Parameterized Perspective., , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 330-343. Springer, (2017)Partitioning subclasses of chordal graphs with few deletions., , , , and . Theor. Comput. Sci., (February 2024)The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 712-726. Springer, (2018)