Prakash Mirchandani A simple O(n^{2}) algorithm for the all-pairs shortest path problem on an interval graph. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:27, n:4, pp:215-217 [Journal]

A. Volgenant An addendum to the most vital edges of matching in a bipartite graph. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:27, n:4, pp:253- [Journal]