American Psychological Association 6th edition

Chen, D. Z., & Wang, H. (2019). Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica, 1-54. https://doi.org/10.1007/s00453-018-00540-x

ISO-690 (author-date, English)

CHEN, Danny Z. and WANG, Haitao, 2019. Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica. 8 January 2019. P. 1-54. DOI 10.1007/s00453-018-00540-x.

Modern Language Association 9th edition

Chen, D. Z., and H. Wang. “Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane”. Algorithmica, Jan. 2019, pp. 1-54, https://doi.org/10.1007/s00453-018-00540-x.

Mohr Siebeck - Recht (Deutsch - Österreich)

Chen, Danny Z./Wang, Haitao: Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane, Algorithmica 2019, 1-54.

Emerald - Harvard

Chen, D.Z. and Wang, H. (2019), “Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane”, Algorithmica, pp. 1-54.

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