Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck. On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 740-753, SIAM, 2016. [doi]
@inproceedings{AbrahamCDGW16,
title = {On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs},
author = {Ittai Abraham and Shiri Chechik and Daniel Delling and Andrew V. Goldberg and Renato F. Werneck},
year = {2016},
doi = {10.1137/1.9781611974331.ch53},
url = {http://dx.doi.org/10.1137/1.9781611974331.ch53},
researchr = {https://researchr.org/publication/AbrahamCDGW16},
cites = {0},
citedby = {0},
pages = {740-753},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016},
editor = {Robert Krauthgamer},
publisher = {SIAM},
isbn = {978-1-61197-433-1},
}