@InProceedings{caceres_et_al:LIPIcs.SEA.2024.3,
author = {C\'{a}ceres, Manuel and Mumey, Brendan and Toivonen, Santeri and Tomescu, Alexandru I.},
title = {{Practical Minimum Path Cover}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.3},
URN = {urn:nbn:de:0030-drops-203687},
doi = {10.4230/LIPIcs.SEA.2024.3},
annote = {Keywords: minimum path cover, directed acyclic graph, maximum flow, parameterized algorithms, edge sparsification, algorithm engineering}
}