American Psychological Association 6th edition

Pilipczuk, M., van Leeuwen, E. J., & Wiese, A. (2020). Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica, 82(6), 1703-1739. https://doi.org/10.1007/s00453-019-00670-w

ISO-690 (author-date, English)

PILIPCZUK, Michał, VAN LEEUWEN, Erik Jan und WIESE, Andreas, 2020. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica. 1 Juni 2020. Vol. 82, no. 6, p. 1703-1739. DOI 10.1007/s00453-019-00670-w.

Modern Language Association 9th edition

Pilipczuk, M., E. J. van Leeuwen, und A. Wiese. „Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.“. Algorithmica, Bd. 82, Nr. 6, Juni 2020, S. 1703-39, https://doi.org/10.1007/s00453-019-00670-w.

Mohr Siebeck - Recht (Deutsch - Österreich)

Pilipczuk, Michał/van Leeuwen, Erik Jan/Wiese, Andreas: Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs., Algorithmica 2020, 1703-1739.

Emerald - Harvard

Pilipczuk, M., van Leeuwen, E.J. und Wiese, A. (2020), „Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.“, Algorithmica, Vol. 82 No. 6, S. 1703-1739.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.