Parameterized Complexity of (A,ℓ)-Path Packing.

MLA

Belmonte, Rémy, et al. “Parameterized Complexity of (A,ℓ)-Path Packing.” Algorithmica, vol. 84, no. 4, Apr. 2022, pp. 871–95. EBSCOhost, https://doi.org/10.1007/s00453-021-00875-y.

APA

Belmonte, R., Hanaka, T., Kanzaki, M., Kiyomi, M., Kobayashi, Y., Kobayashi, Y., Lampis, M., Ono, H., & Otachi, Y. (2022). Parameterized Complexity of (A,ℓ)-Path Packing. Algorithmica, 84(4), 871–895. https://doi.org/10.1007/s00453-021-00875-y

Chicago

Belmonte, Rémy, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, and Yota Otachi. 2022. “Parameterized Complexity of (A,ℓ)-Path Packing.” Algorithmica 84 (4): 871–95. doi:10.1007/s00453-021-00875-y.