APA (7th ed.) Citation

Fellows, M. R., Hermelin, D., Rosamond, F., & Vialette, S. (2009). On the parameterized complexity of multiple-interval graph problems. Theoretical computer science, 410(1), 53-61. https://doi.org/10.1016/j.tcs.2008.09.065

Chicago Style (17th ed.) Citation

Fellows, Michael R., Danny Hermelin, Frances Rosamond, and Stéphane Vialette. "On the Parameterized Complexity of Multiple-interval Graph Problems." Theoretical Computer Science 410, no. 1 (2009): 53-61. https://doi.org/10.1016/j.tcs.2008.09.065.

MLA (9th ed.) Citation

Fellows, Michael R., et al. "On the Parameterized Complexity of Multiple-interval Graph Problems." Theoretical Computer Science, vol. 410, no. 1, 2009, pp. 53-61, https://doi.org/10.1016/j.tcs.2008.09.065.