APA (7th ed.) Citation

Blažej, V., Jana, S., Ramanujan, M. S., & Strulo, P. (2025). On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. Algorithmica, 87(11), 1669-1709. https://doi.org/10.1007/s00453-025-01336-6

Chicago Style (17th ed.) Citation

Blažej, Václav, Satyabrata Jana, M. S. Ramanujan, and Peter Strulo. "On the Parameterized Complexity of Eulerian Strong Component Arc Deletion." Algorithmica 87, no. 11 (2025): 1669-1709. https://doi.org/10.1007/s00453-025-01336-6.

MLA (9th ed.) Citation

Blažej, Václav, et al. "On the Parameterized Complexity of Eulerian Strong Component Arc Deletion." Algorithmica, vol. 87, no. 11, 2025, pp. 1669-1709, https://doi.org/10.1007/s00453-025-01336-6.