APA (7th ed.) Citation

Asodi, V., & Umans, C. (2009). The complexity of the matroid–greedoid partition problem. Theoretical computer science, 410(8), 859-866. https://doi.org/10.1016/j.tcs.2008.11.019

Chicago Style (17th ed.) Citation

Asodi, Vera, and Christopher Umans. "The Complexity of the Matroid–greedoid Partition Problem." Theoretical Computer Science 410, no. 8 (2009): 859-866. https://doi.org/10.1016/j.tcs.2008.11.019.

MLA (9th ed.) Citation

Asodi, Vera, and Christopher Umans. "The Complexity of the Matroid–greedoid Partition Problem." Theoretical Computer Science, vol. 410, no. 8, 2009, pp. 859-866, https://doi.org/10.1016/j.tcs.2008.11.019.