Covering Many (Or Few) Edges with k Vertices in Sparse Graphs

Abstract

Full Citation:

Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer. Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 42:1–42:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.