Qian-Ping Gu, Gengchun Xu. Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs. In Khaled M. Elbassioni, Kazuhisa Makino, editors, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. Volume 9472 of Lecture Notes in Computer Science, pages 625-636, Springer, 2015. [doi]
Abstract is missing.