BibTeX Export for Local Optimization Algorithms for Maximum Planar Subgraph

Copy to Clipboard Download

@InProceedings{calinescu_et_al:LIPIcs.ESA.2024.38,
  author =	{C\u{a}linescu, Gruia and Uniyal, Sumedha},
  title =	{{Local Optimization Algorithms for Maximum Planar Subgraph}},
  booktitle =	{32nd Annual European Symposium on Algorithms (ESA 2024)},
  pages =	{38:1--38:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-338-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{308},
  editor =	{Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.38},
  URN =		{urn:nbn:de:0030-drops-211090},
  doi =		{10.4230/LIPIcs.ESA.2024.38},
  annote =	{Keywords: planar graph, maximum subgraph, approximation algorithm, matroid parity, local 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