BibTeX Export for Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size

Copy to Clipboard Download

@InProceedings{dreier_et_al:LIPIcs.APPROX/RANDOM.2020.14,
  author =	{Dreier, Jan and Kuinke, Philipp and Rossmanith, Peter},
  title =	{{Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
  pages =	{14:1--14:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-164-1},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{176},
  editor =	{Byrka, Jaros{\l}aw and Meka, Raghu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.14},
  URN =		{urn:nbn:de:0030-drops-126171},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2020.14},
  annote =	{Keywords: Random Graphs, Preferential Attachment, Sparsity, Somewhere Dense}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode