APA (7th ed.) Citation

Karpov, N., Pilipczuk, M., & Zych-Pawlewicz, A. (2019). An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica, 81(10), 4029-4042. https://doi.org/10.1007/s00453-018-0504-8

Chicago Style (17th ed.) Citation

Karpov, Nikolai, Marcin Pilipczuk, and Anna Zych-Pawlewicz. "An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs." Algorithmica 81, no. 10 (2019): 4029-4042. https://doi.org/10.1007/s00453-018-0504-8.

MLA (9th ed.) Citation

Karpov, Nikolai, et al. "An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs." Algorithmica, vol. 81, no. 10, 2019, pp. 4029-4042, https://doi.org/10.1007/s00453-018-0504-8.