APA (7th ed.) Citation

Klein, P. N., & Subramanian, S. (1998). A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica, 22(3), 235. https://doi.org/10.1007/PL00009223

Chicago Style (17th ed.) Citation

Klein, P. N., and S. Subramanian. "A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs." Algorithmica 22, no. 3 (1998): 235. https://doi.org/10.1007/PL00009223.

MLA (9th ed.) Citation

Klein, P. N., and S. Subramanian. "A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs." Algorithmica, vol. 22, no. 3, 1998, p. 235, https://doi.org/10.1007/PL00009223.