APA (7th ed.) Citation

Crespelle, C., Perez, A., & Todinca, I. (2019). An O(n2) time algorithm for the minimal permutation completion problem. Discrete Applied Mathematics, 254, 80-95. https://doi.org/10.1016/j.dam.2018.06.036

Chicago Style (17th ed.) Citation

Crespelle, Christophe, Anthony Perez, and Ioan Todinca. "An O(n2) Time Algorithm for the Minimal Permutation Completion Problem." Discrete Applied Mathematics 254 (2019): 80-95. https://doi.org/10.1016/j.dam.2018.06.036.

MLA (9th ed.) Citation

Crespelle, Christophe, et al. "An O(n2) Time Algorithm for the Minimal Permutation Completion Problem." Discrete Applied Mathematics, vol. 254, 2019, pp. 80-95, https://doi.org/10.1016/j.dam.2018.06.036.