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

Koana, Tomohiro; Komusiewicz, Christian; Nichterlein, André; Sommer, Frank

doi:10.4230/LIPICS.STACS.2022.42

by Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer

Reference:

Covering Many (Or Few) Edges with k Vertices in Sparse GraphsTomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer39th 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.

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{KoanaKNS22,
  author       = {Tomohiro Koana and
                  Christian Komusiewicz and
                  Andr{\'{e}} Nichterlein and
                  Frank Sommer},
  editor       = {Petra Berenbrink and
                  Benjamin Monmege},
  title        = {Covering Many (Or Few) Edges with k Vertices in Sparse Graphs},
  booktitle    = {39th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {219},
  pages        = {42:1--42:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2022.42},
  doi          = {10.4230/LIPICS.STACS.2022.42}
}