Siamak Tazari, Matthias Müller-Hannemann. A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. In Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma, editors, Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Volume 5344 of Lecture Notes in Computer Science, pages 360-371, 2008. [doi]
Abstract is missing.