N. R. Aravind, Roopam Saxena. Parameterized Complexity of Path Set Packing. // Algorithmica. – 2025. – DOI: 10.1007/s00453-025-01329-5. – URL: https://doi.org/10.1007/s00453-025-01329-5
N. R. Aravind & Roopam Saxena (2025). Parameterized Complexity of Path Set Packing. Algorithmica. https://doi.org/10.1007/s00453-025-01329-5
N. R. Aravind and Roopam Saxena. “Parameterized Complexity of Path Set Packing.” Algorithmica, 2025. doi:10.1007/s00453-025-01329-5.
@article{Aravind2025,
title = {Parameterized Complexity of Path Set Packing},
author = {Aravind, N. R. and Saxena, Roopam},
journal = {Algorithmica},
year = {2025},
doi = {10.1007/s00453-025-01329-5},
url = {https://doi.org/10.1007/s00453-025-01329-5}
}