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

NILSSON, Bengt J. und 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.

Nilsson, B. J., und E. Packer. „Approximation Algorithms for the Two-Watchman Route in a Simple Polygon“. Algorithmica, Bd. 86, Nr. 9, September 2024, S. 2845-84, https://doi.org/10.1007/s00453-024-01245-0.

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

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