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
Citácia podle Chicago (17th ed.)Fomin, Fedor V., a 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.
Citácia podľa MLA (8th ed.)Fomin, Fedor V., a 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.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..