American Psychological Association 6th edition

Nilsson, B. J., & Packer, E. (2024). Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. Algorithmica, 86(9), 2845-2884. https://doi.org/10.1007/s00453-024-01245-0

ISO-690 (author-date, English)

NILSSON, Bengt J. and PACKER, Eli, 2024. Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. Algorithmica. 1 September 2024. Vol. 86, no. 9, p. 2845-2884. DOI 10.1007/s00453-024-01245-0.

Modern Language Association 9th edition

Nilsson, B. J., and E. Packer. “Approximation Algorithms for the Two-Watchman Route in a Simple Polygon”. Algorithmica, vol. 86, no. 9, Sept. 2024, pp. 2845-84, https://doi.org/10.1007/s00453-024-01245-0.

Mohr Siebeck - Recht (Deutsch - Österreich)

Nilsson, Bengt J./Packer, Eli: Approximation Algorithms for the Two-Watchman Route in a Simple Polygon, Algorithmica 2024, 2845-2884.

Emerald - Harvard

Nilsson, B.J. and Packer, E. (2024), “Approximation Algorithms for the Two-Watchman Route in a Simple Polygon”, Algorithmica, Vol. 86 No. 9, pp. 2845-2884.

Warning: These citations may not always be 100% accurate.