Lin Chen. Tight Lower Bounds for Computing Shortest Paths on Proper Interval and Bipartite Permutation Graphs. In Victor E. Malyshkin, editor, Parallel Computing Technologies, 4th International Conference, PaCT-97, Yaroslavl, Russia, September 8-12, 1997, Proceedings. Volume 1277 of Lecture Notes in Computer Science, pages 7-12, Springer, 1997.
Abstract is missing.