Hong, J.-W.; Mehlhorn, K.: Cost tradeoffs in graph embeddings, with applications, (1982)

Mehlhorn, K.; Overmars, M. H.: Optimal dynamization of decomposable searching problems, (1980)

Mehlhorn, K.: An O(n log n) lower bound for the synchronous circuit size of integer multiplication, (1976)

Mehlhorn, K.: A game on graphs, (1975)

Mehlhorn, K.: Polynomial and abstract subrecursive classes, (1974)

Mehlhorn, K.: On the Size of Sets of Computable Functions, (1973)

Mehlhorn, K.: The "almost all" theory of subrecursive degrees is decidable, (1973)

El Kahoui, M.: Computing with algebraic curves in generic position. (2007)

El Kahoui, M.: Polynomial parametrization of nonsingular algebraic curves. (2007)

Kämper, A.; Lengauer, T.: ECLIPPSE: Environment for Chemical Library Inspection, Pre- and Postprocessing, and Screening Evaluation. User Guide. (2003)