How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length. - Michael Kiran Huber (CoRR, 2024)