The paper "Finding Optimal Longest Paths by Dynamic Programming in Parallel" by Tomas Balyo, Kai Fieger, Dominik Schreiber, and Christian Schulz has been accepted for publication and presentation at the 12th Annual Symposium on Combinatorial Search (SoCS 2019).
