APA (7th ed.) Citation

Fomin, F. V., Golovach, P. A., Karpov, N., & Kulikov, A. S. (2017). Parameterized Complexity of Secluded Connectivity Problems. Theory of computing systems, 61(3), 795-819. https://doi.org/10.1007/s00224-016-9717-x

Chicago Style (17th ed.) Citation

Fomin, Fedor V., Petr A. Golovach, Nikolay Karpov, and Alexander S. Kulikov. "Parameterized Complexity of Secluded Connectivity Problems." Theory of Computing Systems 61, no. 3 (2017): 795-819. https://doi.org/10.1007/s00224-016-9717-x.

MLA (9th ed.) Citation

Fomin, Fedor V., et al. "Parameterized Complexity of Secluded Connectivity Problems." Theory of Computing Systems, vol. 61, no. 3, 2017, pp. 795-819, https://doi.org/10.1007/s00224-016-9717-x.