Parameterized complexity: exponential speed-up for planar graph problems

MLA

Alber, Jochen, et al. “Parameterized Complexity: Exponential Speed-up for Planar Graph Problems.” Journal of Algorithms, vol. 52, no. 1, July 2004, pp. 26–56. EBSCOhost, https://doi.org/10.1016/j.jalgor.2004.03.005.

APA

Alber, J., Fernau, H., & Niedermeier, R. (2004). Parameterized complexity: exponential speed-up for planar graph problems. Journal of Algorithms, 52(1), 26–56. https://doi.org/10.1016/j.jalgor.2004.03.005

Chicago

Alber, Jochen, Henning Fernau, and Rolf Niedermeier. 2004. “Parameterized Complexity: Exponential Speed-up for Planar Graph Problems.” Journal of Algorithms 52 (1): 26–56. doi:10.1016/j.jalgor.2004.03.005.