THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS.

MLA

Wernicke, Sebastian, et al. “The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.” International Journal of Foundations of Computer Science, vol. 17, no. 6, Dec. 2006, pp. 1467–84. EBSCOhost, https://doi.org/10.1142/S0129054106004522.

APA

Wernicke, S., Alber, J., Gramm, J., Guo, J., & Niedermeier, R. (2006). The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. International Journal of Foundations of Computer Science, 17(6), 1467–1484. https://doi.org/10.1142/S0129054106004522

Chicago

Wernicke, Sebastian, Jochen Alber, Jens Gramm, Jiong Guo, and Rolf Niedermeier. 2006. “The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.” International Journal of Foundations of Computer Science 17 (6): 1467–84. doi:10.1142/S0129054106004522.