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
Citace podle Chicago (17th ed.)Fellows, Michael R., Danny Hermelin, Frances Rosamond, a 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.
Citace podle MLA (9th ed.)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.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..