APA (7th ed.) Citation

Weller, M., Chateau, A., Dallard, C., & Giroudeau, R. (2018). Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica, 80(6), 1771-1803. https://doi.org/10.1007/s00453-018-0405-x

Chicago Style (17th ed.) Citation

Weller, Mathias, Annie Chateau, Clément Dallard, and Rodolphe Giroudeau. "Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases." Algorithmica 80, no. 6 (2018): 1771-1803. https://doi.org/10.1007/s00453-018-0405-x.

MLA (9th ed.) Citation

Weller, Mathias, et al. "Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases." Algorithmica, vol. 80, no. 6, 2018, pp. 1771-1803, https://doi.org/10.1007/s00453-018-0405-x.