APA (7th ed.) Citation

Chen, D. Z., Klenk, K. S., & Tu, H. T. (2000). SHORTEST PATH QUERIES AMONG WEIGHTED OBSTACLES IN THE RECTILINEAR PLANE. SIAM Journal on Computing, 29(4), 1223. https://doi.org/10.1137/S0097539796307194

Chicago Style (17th ed.) Citation

Chen, Danny Z., Kevin S. Klenk, and Hung-Yi T. Tu. "SHORTEST PATH QUERIES AMONG WEIGHTED OBSTACLES IN THE RECTILINEAR PLANE." SIAM Journal on Computing 29, no. 4 (2000): 1223. https://doi.org/10.1137/S0097539796307194.

MLA (9th ed.) Citation

Chen, Danny Z., et al. "SHORTEST PATH QUERIES AMONG WEIGHTED OBSTACLES IN THE RECTILINEAR PLANE." SIAM Journal on Computing, vol. 29, no. 4, 2000, p. 1223, https://doi.org/10.1137/S0097539796307194.