pdfformat: 

@InProceedings{khanna_et_al:LIPIcs:2020:13268, author = {Yash Khanna and Anand Louis}, title = {{Planted Models for the Densest kSubgraph Problem}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {27:127:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771740}, ISSN = {18688969}, year = {2020}, volume = {182}, editor = {Nitin Saxena and Sunil Simon}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13268}, URN = {urn:nbn:de:0030drops132682}, doi = {10.4230/LIPIcs.FSTTCS.2020.27}, annote = {Keywords: Densest kSubgraph, SemiRandom models, Planted Models, Semidefinite Programming, Approximation Algorithms, Beyond Worst Case Analysis} }
Keywords:  Densest kSubgraph, SemiRandom models, Planted Models, Semidefinite Programming, Approximation Algorithms, Beyond Worst Case Analysis  
Seminar:  40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)  
Issue date:  2020  
Date of publication:  04.12.2020 