BibTeX Export for Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments

Copy to Clipboard Download

@InProceedings{chimani_et_al:LIPIcs.SEA.2018.22,
  author =	{Chimani, Markus and Hedtke, Ivo and Wiedera, Tilo},
  title =	{{Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments}},
  booktitle =	{17th International Symposium on Experimental Algorithms (SEA 2018)},
  pages =	{22:1--22:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{D'Angelo, Gianlorenzo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.22},
  URN =		{urn:nbn:de:0030-drops-89572},
  doi =		{10.4230/LIPIcs.SEA.2018.22},
  annote =	{Keywords: maximum planar subgraph, integer linear programming, pseudo boolean satisfiability, graph drawing, algorithm engineering}
}

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