Fieger, K., Balyo, T., Schulz, C., & Schreiber, D. (2021). Finding Optimal Longest Paths by Dynamic Programming in Parallel. Proceedings of the International Symposium on Combinatorial Search, 10(1), 61–69. https://doi.org/10.1609/socs.v10i1.18503