APA (7th ed.) Citation

Disser, Y., Kratsch, S., & Sorge, M. (2019). The Minimum Feasible Tileset Problem. Algorithmica, 81(3), 1126-1151. https://doi.org/10.1007/s00453-018-0460-3

Chicago Style (17th ed.) Citation

Disser, Yann, Stefan Kratsch, and Manuel Sorge. "The Minimum Feasible Tileset Problem." Algorithmica 81, no. 3 (2019): 1126-1151. https://doi.org/10.1007/s00453-018-0460-3.

MLA (9th ed.) Citation

Disser, Yann, et al. "The Minimum Feasible Tileset Problem." Algorithmica, vol. 81, no. 3, 2019, pp. 1126-1151, https://doi.org/10.1007/s00453-018-0460-3.