APA (7th ed.) Citation

Eisenbrand, F., & Grandoni, F. (2004). On the complexity of fixed parameter clique and dominating set. Theoretical computer science, 326(1), 57-67. https://doi.org/10.1016/j.tcs.2004.05.009

Chicago Style (17th ed.) Citation

Eisenbrand, Friedrich, and Fabrizio Grandoni. "On the Complexity of Fixed Parameter Clique and Dominating Set." Theoretical Computer Science 326, no. 1 (2004): 57-67. https://doi.org/10.1016/j.tcs.2004.05.009.

MLA (9th ed.) Citation

Eisenbrand, Friedrich, and Fabrizio Grandoni. "On the Complexity of Fixed Parameter Clique and Dominating Set." Theoretical Computer Science, vol. 326, no. 1, 2004, pp. 57-67, https://doi.org/10.1016/j.tcs.2004.05.009.