APA (7th ed.) Citation

Fomin, F. V., & Ramamoorthi, V. (2022). On the Parameterized Complexity of the Expected Coverage Problem. Theory of computing systems, 66(2), 432-453. https://doi.org/10.1007/s00224-022-10073-0

Chicago Style (17th ed.) Citation

Fomin, Fedor V., and Vijayaragunathan Ramamoorthi. "On the Parameterized Complexity of the Expected Coverage Problem." Theory of Computing Systems 66, no. 2 (2022): 432-453. https://doi.org/10.1007/s00224-022-10073-0.

MLA (9th ed.) Citation

Fomin, Fedor V., and Vijayaragunathan Ramamoorthi. "On the Parameterized Complexity of the Expected Coverage Problem." Theory of Computing Systems, vol. 66, no. 2, 2022, pp. 432-453, https://doi.org/10.1007/s00224-022-10073-0.

Warning: These citations may not always be 100% accurate.