BibTeX Export for The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern

Copy to Clipboard Download

@InProceedings{krauthgamer_et_al:LIPIcs.STACS.2019.45,
  author =	{Krauthgamer, Robert and Trabelsi, Ohad},
  title =	{{The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{45:1--45:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Niedermeier, Rolf and Paul, Christophe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.45},
  URN =		{urn:nbn:de:0030-drops-102840},
  doi =		{10.4230/LIPIcs.STACS.2019.45},
  annote =	{Keywords: Conditional lower bounds, Hardness in P, Set Cover Conjecture, Subgraph Isomorphism}
}

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