@InProceedings{inamdar_et_al:LIPIcs.ICALP.2024.88,
author = {Inamdar, Tanmay and Jain, Pallavi and Lokshtanov, Daniel and Sahu, Abhishek and Saurabh, Saket and Upasana, Anannya},
title = {{Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {88:1--88:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.88},
URN = {urn:nbn:de:0030-drops-202318},
doi = {10.4230/LIPIcs.ICALP.2024.88},
annote = {Keywords: Partial Vertex Cover, Max SAT, FPT Approximation, Matroids}
}