Constant Query Time (1+ epsilon ) -Approximate Distance Oracle for Planar Graphs. - Qian-Ping Gu; Gengchun Xu (ISAAC, 2015)

Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs. - Qian-Ping Gu; Gengchun Xu (CoRR, 2017)

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. - Qian-Ping Gu; Gengchun Xu (Discret. Appl. Math., 2019)

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs. - Qian-Ping Gu; Gengchun Xu (Theor. Comput. Sci., 2019)