APA (7th ed.) Citation

Mitchell, J., Piatko, C., & Arkin, E. (1992). Computing a shortest k-link path in a polygon. Foundations of Computer Science, 33rd Symposium on (FOCS '92), 573-582. https://doi.org/10.1109/SFCS.1992.267794

Chicago Style (17th ed.) Citation

Mitchell, J.S.B, C. Piatko, and E.M Arkin. "Computing a Shortest K-link Path in a Polygon." Foundations of Computer Science, 33rd Symposium on (FOCS '92) 1992: 573-582. https://doi.org/10.1109/SFCS.1992.267794.

MLA (9th ed.) Citation

Mitchell, J.S.B, et al. "Computing a Shortest K-link Path in a Polygon." Foundations of Computer Science, 33rd Symposium on (FOCS '92), 1992, pp. 573-582, https://doi.org/10.1109/SFCS.1992.267794.