@inproceedings{FominSS20,
 address = {Dagstuhl, Germany},
 annote = {Keywords: parameterized complexity, k-core, vertex cover, treewidth},
 author = {Fedor V. Fomin and Danil Sagunov and Kirill Simonov},
 booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
 doi = {10.4230/LIPIcs.MFCS.2020.35},
 editor = {Javier Esparza and Daniel Kráľ},
 isbn = {978-3-95977-159-7},
 issn = {1868-8969},
 pages = {35:1–35:14},
 publisher = {Schloss Dagstuhl–Leibniz-Zentrum f{ü}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 title = {{Building Large k-Cores from Sparse Graphs}},
 url = {https://drops.dagstuhl.de/opus/volltexte/2020/12702},
 urn = {urn:nbn:de:0030-drops-127026},
 volume = {170},
 year = {2020}
}