Ittai Abraham, Shiri Chechik, Kunal Talwar. Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 1-16, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]
@inproceedings{AbrahamCT14, title = {Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier}, author = {Ittai Abraham and Shiri Chechik and Kunal Talwar}, year = {2014}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.1}, url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.1}, researchr = {https://researchr.org/publication/AbrahamCT14}, cites = {0}, citedby = {0}, pages = {1-16}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain}, editor = {Klaus Jansen and José D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, volume = {28}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-939897-74-3}, }