Many distances in planar graphs

Sergio Cabello. Many distances in planar graphs. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 1213-1220, ACM Press, 2006. [doi]

@inproceedings{Cabello06,
  title = {Many distances in planar graphs},
  author = {Sergio Cabello},
  year = {2006},
  doi = {10.1145/1109557.1109691},
  url = {http://doi.acm.org/10.1145/1109557.1109691},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Cabello06},
  cites = {0},
  citedby = {0},
  pages = {1213-1220},
  booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {ACM Press},
  isbn = {0-89871-605-5},
}