BibTeX Export for Hardness of Metric Dimension in Graphs of Constant Treewidth

Copy to Clipboard Download

@InProceedings{li_et_al:LIPIcs.IPEC.2021.24,
  author =	{Li, Shaohua and Pilipczuk, Marcin},
  title =	{{Hardness of Metric Dimension in Graphs of Constant Treewidth}},
  booktitle =	{16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
  pages =	{24:1--24:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-216-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{214},
  editor =	{Golovach, Petr A. and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.24},
  URN =		{urn:nbn:de:0030-drops-154071},
  doi =		{10.4230/LIPIcs.IPEC.2021.24},
  annote =	{Keywords: Graph algorithms, parameterized complexity, width parameters, NP-hard}
}

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