Philip N. Klein, Sairam Subramanian. A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings. Volume 709 of Lecture Notes in Computer Science, pages 442-451, Springer, 1993.
@inproceedings{KleinS93:1,
title = {A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs},
author = {Philip N. Klein and Sairam Subramanian},
year = {1993},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KleinS93%3A1},
cites = {0},
citedby = {0},
pages = {442-451},
booktitle = {Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings},
editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro and Sue Whitesides},
volume = {709},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-57155-8},
}