@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.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}
}