JING, Yifan und MOHAR, Bojan, 2024. Efficient polynomial-time approximation scheme for the genus of dense graphs. Journal of the ACM. 1 Dezember 2024. Vol. 71, no. 6, p. 1-33. DOI 10.1145/3690821.
Elsevier - Harvard (with titles)Jing, Y., Mohar, B., 2024. Efficient polynomial-time approximation scheme for the genus of dense graphs. Journal of the ACM 71, 1-33. https://doi.org/10.1145/3690821
American Psychological Association 7th editionJing, Y., & Mohar, B. (2024). Efficient polynomial-time approximation scheme for the genus of dense graphs. Journal of the ACM, 71(6), 1-33. https://doi.org/10.1145/3690821
Springer - Basic (author-date)Jing Y, Mohar B (2024) Efficient polynomial-time approximation scheme for the genus of dense graphs.. Journal of the ACM 71:1-33. https://doi.org/10.1145/3690821
Juristische Zitierweise (Stüber) (Deutsch)Jing, Yifan/ Mohar, Bojan, Efficient polynomial-time approximation scheme for the genus of dense graphs., Journal of the ACM 2024, 1-33.