APA (7th ed.) Citation

Wang, J., Feng, Q., & Chen, J. (2011). An O ∗ ( 3.5 3 3 k ) -time parameterized algorithm for the 3-set packing problem. Theoretical computer science, 412(18), 1745-1753. https://doi.org/10.1016/j.tcs.2010.12.048

Chicago Style (17th ed.) Citation

Wang, Jianxin, Qilong Feng, and Jianer Chen. "An O ∗ ( 3.5 3 3 K ) -time Parameterized Algorithm for the 3-set Packing Problem." Theoretical Computer Science 412, no. 18 (2011): 1745-1753. https://doi.org/10.1016/j.tcs.2010.12.048.

MLA (9th ed.) Citation

Wang, Jianxin, et al. "An O ∗ ( 3.5 3 3 K ) -time Parameterized Algorithm for the 3-set Packing Problem." Theoretical Computer Science, vol. 412, no. 18, 2011, pp. 1745-1753, https://doi.org/10.1016/j.tcs.2010.12.048.