Maximal biconnected subgraphs of random planar graphs

Konstantinos Panagiotou, Angelika Steger. Maximal biconnected subgraphs of random planar graphs. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 432-440, SIAM, 2009. [doi]

@inproceedings{PanagiotouS09,
  title = {Maximal biconnected subgraphs of random planar graphs},
  author = {Konstantinos Panagiotou and Angelika Steger},
  year = {2009},
  doi = {10.1145/1496770.1496818},
  url = {http://doi.acm.org/10.1145/1496770.1496818},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/PanagiotouS09},
  cites = {0},
  citedby = {0},
  pages = {432-440},
  booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009},
  editor = {Claire Mathieu},
  publisher = {SIAM},
}