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

@InProceedings{koana_et_al:LIPIcs:2020:13364, author = {Tomohiro Koana and Christian Komusiewicz and Frank Sommer}, title = {{Computing Dense and Sparse Subgraphs of Weakly Closed Graphs}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {20:120:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771733}, ISSN = {18688969}, year = {2020}, volume = {181}, editor = {Yixin Cao and SiuWing Cheng and Minming Li}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13364}, URN = {urn:nbn:de:0030drops133646}, doi = {10.4230/LIPIcs.ISAAC.2020.20}, annote = {Keywords: Fixedparameter tractability, cclosure, degeneracy, clique relaxations, bicliques, dominating set} }
Keywords:  Fixedparameter tractability, cclosure, degeneracy, clique relaxations, bicliques, dominating set  
Collection:  31st International Symposium on Algorithms and Computation (ISAAC 2020)  
Issue Date:  2020  
Date of publication:  04.12.2020 