APA (7th ed.) Citation

Kratsch, S., & Nelles, F. (2023). Efficient parameterized algorithms for computing all-pairs shortest paths. Discrete Applied Mathematics, 341, 102-119. https://doi.org/10.1016/j.dam.2023.07.029

Chicago Style (17th ed.) Citation

Kratsch, Stefan, and Florian Nelles. "Efficient Parameterized Algorithms for Computing All-pairs Shortest Paths." Discrete Applied Mathematics 341 (2023): 102-119. https://doi.org/10.1016/j.dam.2023.07.029.

MLA (9th ed.) Citation

Kratsch, Stefan, and Florian Nelles. "Efficient Parameterized Algorithms for Computing All-pairs Shortest Paths." Discrete Applied Mathematics, vol. 341, 2023, pp. 102-119, https://doi.org/10.1016/j.dam.2023.07.029.