62 citations · 316 across the 38 of their papers we have counts for
1 paper · 2 filters
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
We consider the problem of computing shortest paths in weighted unit-disk graphs in constant dimension d. Although the single-source and all-pairs variants of this problem are we…