Timothy M. Chan, Dimitrios Skrepetos. All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. In Seok-Hee Hong, editor, 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia. Volume 64 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{ChanS16-1,
title = {All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time},
author = {Timothy M. Chan and Dimitrios Skrepetos},
year = {2016},
doi = {10.4230/LIPIcs.ISAAC.2016.24},
url = {http://dx.doi.org/10.4230/LIPIcs.ISAAC.2016.24},
researchr = {https://researchr.org/publication/ChanS16-1},
cites = {0},
citedby = {0},
booktitle = {27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia},
editor = {Seok-Hee Hong},
volume = {64},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-026-2},
}