Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover. - Anna Kuosmanen; Topi Paavilainen; Travis Gagie; Rayan Chikhi; Alexandru I. Tomescu; Veli Mäkinen (CoRR, 2017)

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended. - Anna Kuosmanen; Topi Paavilainen; Travis Gagie; Rayan Chikhi; Alexandru I. Tomescu; Veli Mäkinen (RECOMB, 2018)

Sparse Dynamic Programming on DAGs with Small Width. - Veli Mäkinen; Alexandru I. Tomescu; Anna Kuosmanen; Topi Paavilainen; Travis Gagie; Rayan Chikhi (ACM Trans. Algorithms, 2019)