@InProceedings{fomin_et_al:LIPIcs.MFCS.2020.35,
  author =	{Fomin, Fedor V. and Sagunov, Danil and Simonov, Kirill},
  title =	{{Building Large k-Cores from Sparse Graphs}},
  booktitle =	{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
  pages =	{35:1--35:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-159-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{170},
  editor =	{Esparza, Javier and Kr\'{a}l', Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.35},
  URN =		{urn:nbn:de:0030-drops-127026},
  doi =		{10.4230/LIPIcs.MFCS.2020.35},
  annote =	{Keywords: parameterized complexity, k-core, vertex cover, treewidth}
}