BibTeX Export for Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast

Copy to Clipboard Download

@InProceedings{chimani_et_al:LIPIcs.ESA.2018.19,
  author =	{Chimani, Markus and Wiedera, Tilo},
  title =	{{Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast}},
  booktitle =	{26th Annual European Symposium on Algorithms (ESA 2018)},
  pages =	{19:1--19:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-081-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{112},
  editor =	{Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.19},
  URN =		{urn:nbn:de:0030-drops-94829},
  doi =		{10.4230/LIPIcs.ESA.2018.19},
  annote =	{Keywords: algorithm engineering, graph algorithms, integer linear programming, maximum planar subgraph}
}

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