- Doris Altenkamp and Kurt Mehlhorn. Codes: Unequal probabilities,
unequal letter cost. Journal of the ACM, 27(3):412-427,
July 1980.
Citations.
- Jia-Wei Hong, Kurt Mehlhorn, and Arnold L. Rosenberg. Cost trade-offs in graph embeddings,
with applications. Journal of the ACM, 30(4):709-728,
October 1983.
Citations.
- K. Mehlhorn and F. P. Preparata. Routing through a rectangle.
Journal of the ACM, 33(1):60-85, January 1986.
Citations.
- Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan.
Faster algorithms for
the shortest path problem. Journal of the ACM,
37(2):213-223, April 1990.
Citations.
- Kurt Mehlhorn and Athanasios Tsakalidis. Dynamic interpolation search.
Journal of the ACM, 40(3):621-634, July 1993.
References
and Citations.
Shortcuts: