@InProceedings{bandopadhyay_et_al:LIPIcs.MFCS.2024.16,
author = {Bandopadhyay, Susobhan and Banik, Aritra and Majumdar, Diptapriyo and Sahu, Abhishek},
title = {{Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints}},
booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-335-5},
ISSN = {1868-8969},
year = {2024},
volume = {306},
editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.16},
URN = {urn:nbn:de:0030-drops-205725},
doi = {10.4230/LIPIcs.MFCS.2024.16},
annote = {Keywords: Parameterized complexity, (A,𝓁)-Path Packing, Kernelization, Randomized-Exponential Time Hypothesis, Graph Classes}
}