Go to the corresponding LIPIcs Volume Portal 
Koana, Tomohiro ; Komusiewicz, Christian ; Nichterlein, André ; Sommer, Frank
pdfformat: 

@InProceedings{koana_et_al:LIPIcs.STACS.2022.42, author = {Koana, Tomohiro and Komusiewicz, Christian and Nichterlein, Andr\'{e} and Sommer, Frank}, title = {{Covering Many (Or Few) Edges with k Vertices in Sparse Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {42:142:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772228}, ISSN = {18688969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15852}, URN = {urn:nbn:de:0030drops158525}, doi = {10.4230/LIPIcs.STACS.2022.42}, annote = {Keywords: Parameterized Complexity, Kernelization, Partial Vertex Cover, Densest kSubgraph, Max (k,nk)Cut, Degeneracy} }
Keywords:  Parameterized Complexity, Kernelization, Partial Vertex Cover, Densest kSubgraph, Max (k,nk)Cut, Degeneracy  
Collection:  39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)  
Issue Date:  2022  
Date of publication:  09.03.2022 