Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer. Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. In Petra Berenbrink, Benjamin Monmege, editors, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Volume 219 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{KoanaKNS22,
title = {Covering Many (Or Few) Edges with k Vertices in Sparse Graphs},
author = {Tomohiro Koana and Christian Komusiewicz and André Nichterlein and Frank Sommer},
year = {2022},
doi = {10.4230/LIPIcs.STACS.2022.42},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.42},
researchr = {https://researchr.org/publication/KoanaKNS22},
cites = {0},
citedby = {0},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
editor = {Petra Berenbrink and Benjamin Monmege},
volume = {219},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-222-8},
}