- Donald B. Johnson. A note
on Dijkstra's shortest path algorithm. Journal of the
ACM, 20(3):385-388, July 1973.
References,
etc.
- Donald B. Johnson. Efficient algorithms for shortest
paths in sparse networks. Journal of the ACM,
24(1):1-13, January 1977.
Citations.
- Donald B. Johnson and Samuel D. Kashdan. Lower bounds for selection in
X+Y and other multisets. Journal of the
ACM, 25(4):556-570, October 1978.
Citations.
- Donald B. Johnson, Webb Miller, Brian Minnihan, and Celia Wrathall. Reducibility among
floating-point graphs. Journal of the ACM,
26(4):739-760, October 1979.
- Teofilo F. Gonzalez and Donald B. Johnson. A new algorithm for preemptive
scheduling of trees. Journal of the ACM, 27(2):287-312,
April 1980.
Citations.
- Donald B. Johnson. Parallel algorithms for minimum
cuts and maximum flows in planar networks. Journal of the
ACM, 34(4):950-967, October 1987.
Citations.
Shortcuts: