APA (7th ed.) Citation

Bodlaender, H. L., Fomin, F. V., Golovach, P. A., Otachi, Y., & van Leeuwen, E. J. (2012). Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica, 64(1), 85-111. https://doi.org/10.1007/s00453-011-9565-7

Chicago Style (17th ed.) Citation

Bodlaender, Hans L., Fedor V. Fomin, Petr A. Golovach, Yota Otachi, and Erik Jan van Leeuwen. "Parameterized Complexity of the Spanning Tree Congestion Problem." Algorithmica 64, no. 1 (2012): 85-111. https://doi.org/10.1007/s00453-011-9565-7.

MLA (9th ed.) Citation

Bodlaender, Hans L., et al. "Parameterized Complexity of the Spanning Tree Congestion Problem." Algorithmica, vol. 64, no. 1, 2012, pp. 85-111, https://doi.org/10.1007/s00453-011-9565-7.