APA (7th ed.) Citation

Galby, E., Marx, D., Schepper, P., Sharma, R., & Tale, P. (2023). Parameterized complexity of multicut in weighted trees. Theoretical computer science, 978, 114174. https://doi.org/10.1016/j.tcs.2023.114174

Chicago Style (17th ed.) Citation

Galby, Esther, Dániel Marx, Philipp Schepper, Roohani Sharma, and Prafullkumar Tale. "Parameterized Complexity of Multicut in Weighted Trees." Theoretical Computer Science 978 (2023): 114174. https://doi.org/10.1016/j.tcs.2023.114174.

MLA (9th ed.) Citation

Galby, Esther, et al. "Parameterized Complexity of Multicut in Weighted Trees." Theoretical Computer Science, vol. 978, 2023, p. 114174, https://doi.org/10.1016/j.tcs.2023.114174.