8 citations · 14 across the 18 of their papers we have counts for
1 paper · 1 filter
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…