BibTeX Export for Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)

Copy to Clipboard Download

@InProceedings{moalic_et_al:LIPIcs.SoCG.2020.84,
  author =	{Moalic, Laurent and Schmitt, Dominique and Lepagnot, Julien and Kritter, Julien},
  title =	{{Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{84:1--84:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Cabello, Sergio and Chen, Danny Z.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.84},
  URN =		{urn:nbn:de:0030-drops-122423},
  doi =		{10.4230/LIPIcs.SoCG.2020.84},
  annote =	{Keywords: metaheuristics, memetic algorithms, convex partition optimization}
}

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