American Psychological Association 6th edition

Andreev, A., Kochemazov, S., & Semenov, A. (2025). Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. PLo S ONE, 20(9), 1-31. https://doi.org/10.1371/journal.pone.0331109

ISO-690 (author-date, English)

ANDREEV, Alexander, KOCHEMAZOV, Stepan und SEMENOV, Alexander, 2025. Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. PLo S ONE. 8 September 2025. Vol. 20, no. 9, p. 1-31. DOI 10.1371/journal.pone.0331109.

Modern Language Association 9th edition

Andreev, A., S. Kochemazov, und A. Semenov. „Combining Greedy and Evolutionary Algorithms to Maximize Influence in Networks under Deterministic Linear Threshold Model.“. PLo S ONE, Bd. 20, Nr. 9, September 2025, S. 1-31, https://doi.org/10.1371/journal.pone.0331109.

Mohr Siebeck - Recht (Deutsch - Österreich)

Andreev, Alexander/Kochemazov, Stepan/Semenov, Alexander: Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model., PLo S ONE 2025, 1-31.

Emerald - Harvard

Andreev, A., Kochemazov, S. und Semenov, A. (2025), „Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model.“, PLo S ONE, Vol. 20 No. 9, S. 1-31.

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