Doerr, Benjamin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Asano, T., & Doerr, B. (2011). Memory-constrained Algorithms for Shortest Path Problem. In 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011) (pp. 315-319). Toronto, Canada: CCCG.CA. Retrieved from http://www.cccg.ca/proceedings/2011/papers/paper15.pdf.