_id,doi,title
11891,10.1137/140957299,Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization