BibTeX Export for On the Complexity of Minimum-Link Path Problems

Copy to Clipboard Download

@InProceedings{kostitsyna_et_al:LIPIcs.SoCG.2016.49,
  author =	{Kostitsyna, Irina and L\"{o}ffler, Maarten and Polishchuk, Valentin and Staals, Frank},
  title =	{{On the Complexity of Minimum-Link Path Problems}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{49:1--49:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-009-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{51},
  editor =	{Fekete, S\'{a}ndor and Lubiw, Anna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.49},
  URN =		{urn:nbn:de:0030-drops-59412},
  doi =		{10.4230/LIPIcs.SoCG.2016.49},
  annote =	{Keywords: minimum-linkpath, diffuse reflection, terrain, bit complexity, NP-hardness}
}

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