| 2002 |
|---|
| 5 | EE | Kurt Mehlhorn,
Volker Priebe,
Guido Schäfer,
Naveen Sivadasan:
All-pairs shortest-paths computation in the presence of negative cycles.
Inf. Process. Lett. 81(6): 341-343 (2002) |
| 2000 |
|---|
| 4 | | Colin Cooper,
Alan M. Frieze,
Kurt Mehlhorn,
Volker Priebe:
Average-case complexity of shortest-paths problems in the vertex-potential model.
Random Struct. Algorithms 16(1): 33-46 (2000) |
| 1997 |
|---|
| 3 | | Colin Cooper,
Alan M. Frieze,
Kurt Mehlhorn,
Volker Priebe:
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model.
RANDOM 1997: 15-26 |
| 2 | | Kurt Mehlhorn,
Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka.
Random Struct. Algorithms 10(1-2): 205-220 (1997) |
| 1995 |
|---|
| 1 | | Kurt Mehlhorn,
Volker Priebe:
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka.
ESA 1995: 185-198 |
