Jansen, B. M. P., Pilipczuk, M., & Wrochna, M. (2019). Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica, 81(10), 3936-3967. https://doi.org/10.1007/s00453-019-00614-4
Chicago Style (17th ed.) CitationJansen, Bart M. P., Marcin Pilipczuk, and Marcin Wrochna. "Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor." Algorithmica 81, no. 10 (2019): 3936-3967. https://doi.org/10.1007/s00453-019-00614-4.
MLA (9th ed.) CitationJansen, Bart M. P., et al. "Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor." Algorithmica, vol. 81, no. 10, 2019, pp. 3936-3967, https://doi.org/10.1007/s00453-019-00614-4.
Warning: These citations may not always be 100% accurate.