On the Parameterized Complexity of the Expected Coverage Problem.

MLA

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

APA

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

Fomin, Fedor V., and Vijayaragunathan Ramamoorthi. 2022. “On the Parameterized Complexity of the Expected Coverage Problem.” Theory of Computing Systems 66 (2): 432–53. doi:10.1007/s00224-022-10073-0.