American Psychological Association 6th edition

Artamonov, S., & Babenko, M. (2024). Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Algorithmica, 86(3), 717-734. https://doi.org/10.1007/s00453-023-01148-6

ISO-690 (author-date, English)

ARTAMONOV, Stepan and BABENKO, Maxim, 2024. Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Algorithmica. 1 March 2024. Vol. 86, no. 3, p. 717-734. DOI 10.1007/s00453-023-01148-6.

Modern Language Association 9th edition

Artamonov, S., and M. Babenko. “Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings”. Algorithmica, vol. 86, no. 3, Mar. 2024, pp. 717-34, https://doi.org/10.1007/s00453-023-01148-6.

Mohr Siebeck - Recht (Deutsch - Österreich)

Artamonov, Stepan/Babenko, Maxim: Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings, Algorithmica 2024, 717-734.

Emerald - Harvard

Artamonov, S. and Babenko, M. (2024), “Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings”, Algorithmica, Vol. 86 No. 3, pp. 717-734.

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