@inbook{52e165ae3d2f4c5db638967dcdce0618,
title = "Planar graph augmentation problems: 2nd Workshop, WADS '91 Ottawa, Canada, August 14{\textendash}16, 1991 Proceedings",
abstract = "In this paper we investigate the problem of adding a minimum number of edges to a planar graph in such a way that the resulting graph is biconnected and still planar. It is shown that this problem is NP-complete. We present an approximation algorithm for this planar biconnectivity augmentation problem that has performance ratio 3/2 and uses O(n\textasciicircum{}2 log n) time. An O(n\textasciicircum{}3) approximation algorithm with performance ratio 5/4 is presented to make a biconnected planar graph triconnected by adding edges without losing planarity.",
author = "Goos Kant and Hans Bodlaender",
year = "1991",
doi = "10.1007/BFb0028270",
language = "English",
isbn = "978-3-540-54343-5",
volume = "519",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "286--298",
editor = "Frank Dehne and J{\"o}rg-R{\"u}diger Sack and Nicola Santoro",
booktitle = "Algorithms and Data Structures",
}