APA (7th ed.) Citation

Bannai, H., I, T., Kociumaka, T., Köppl, D., & Puglisi, S. J. (2022). Computing Longest (Common) Lyndon Subsequences. Combinatorial Algorithms, 13270, 128-142. https://doi.org/10.1007/978-3-031-06678-8_10

Chicago Style (17th ed.) Citation

Bannai, Hideo, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, and Simon J. Puglisi. "Computing Longest (Common) Lyndon Subsequences." Combinatorial Algorithms 13270 (2022): 128-142. https://doi.org/10.1007/978-3-031-06678-8_10.

MLA (9th ed.) Citation

Bannai, Hideo, et al. "Computing Longest (Common) Lyndon Subsequences." Combinatorial Algorithms, vol. 13270, 2022, pp. 128-142, https://doi.org/10.1007/978-3-031-06678-8_10.