APA (7th ed.) Citation

Mitani, K., Mieno, T., Seto, K., & Horiyama, T. (2023). Finding top-k longest palindromes in substrings. Theoretical computer science, 979, 114183. https://doi.org/10.1016/j.tcs.2023.114183

Chicago Style (17th ed.) Citation

Mitani, Kazuki, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama. "Finding Top-k Longest Palindromes in Substrings." Theoretical Computer Science 979 (2023): 114183. https://doi.org/10.1016/j.tcs.2023.114183.

MLA (9th ed.) Citation

Mitani, Kazuki, et al. "Finding Top-k Longest Palindromes in Substrings." Theoretical Computer Science, vol. 979, 2023, p. 114183, https://doi.org/10.1016/j.tcs.2023.114183.