_id,doi,title
11856,10.1109/focs.2013.64,Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization