@InProceedings{holm_et_al:LIPIcs.ESA.2017.50,
author = {Holm, Jacob and Italiano, Giuseppe F. and Karczmarz, Adam and Lacki, Jakub and Rotenberg, Eva and Sankowski, Piotr},
title = {{Contracting a Planar Graph Efficiently}},
booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)},
pages = {50:1--50:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-049-1},
ISSN = {1868-8969},
year = {2017},
volume = {87},
editor = {Pruhs, Kirk and Sohler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.50},
URN = {urn:nbn:de:0030-drops-78755},
doi = {10.4230/LIPIcs.ESA.2017.50},
annote = {Keywords: planar graphs, algorithms, data structures, connectivity, coloring}
}