Dietrich, A.; Wald, I.; Slusallek, P.: Interaktive Visualisierung eines hoch komplexen Boeing 777 Modells, Informatik Spektrum 27, S. 394 - 394 (2004)

James, J.; Das, A. V.; Rahnenführer, J.; Leon, F.; Ahmad, I.: Identification of rat brahma (rBRM), a subunit of SWI/SNF chromatin remodeling complex: Involvement in the differentiation of retinal stem cells/progenitors, (2003)

Antes, I.; Klein, M. L.: The formation of a β-Peptide/DPC-micelle complex studied by MD simulations, (2001)

Crauser, A.; Meyer, U.; Brengel, K.: An experimental study of priority queues in external memory, (2001)

Kämper, A.; Apostolakis, J.; Rarey, M.; Marian, C. M.; Lengauer, T.: Docking of Ligands into Artificial Receptors, (2001)

Nonnengart, A.; Ohlbach, H. J.; Szalas, A.: Quantifier Elimination for Second-Order Predicate Logic, (2001)

Wendt, U.; Lange, K.; Ray, R.; Smid, M.: Surface Topography Quantification using Computational Geometry, (2001)

Shegalov, G.; Gillmann, M.; Weikum, G.: XML-enabled Workflow Management for E-Services across Heterogeneous Platforms, (2000)

Banderier, C.: An Introduction to Analytic Number Theory, (1999)

Weydert, E.: Some Notes on Nonmonotonic Probabilistic Inference, (1998)

Ohlbach, H. J.: Boolean Algebras with Functions - Correspondence, Completeness and Quantifier Elimination, (1995)

Hopf, J.: Genetic Algorithms within the Framework of Evolutionary Computation, (1994)

Dobrindt, K.; Mehlhorn, K.; Yvinec, M.: A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron, (1993)

Alt, H.; Guibas, L.; Mehlhorn, K.; Karp, R. M.; Wigderson, A.: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities, (1991)

Dietzfelbinger, M.; Karlin, A.; Mehlhorn, K.; Meyer Auf Der Heide, F.; Rohnert, H.; Tarjan, R. E.: Dynamic Perfect Hashing: Upper and Lower Bounds, (1991)

Cheriyan, J.; Hagerup, T.; Mehlhorn, K.: Can a maximum flow be computed in $o(nm)$ time?, (1990)

Mehlhorn, K.; Yap, C.-K.: Constructive Hopf's theorem: or how to untangle closed planar curves, (1988)

Mehlhorn, K.: A Faster Approximation Algorithm for the Steiner Problem in Graphs, (1987)

Mehlhorn, K.; Näher, S.; Alt, H.: A Lower Bound for the Complexity of the Union-Split-Find Problem, (1986)

Mehlhorn, K.; Preparata, F. P.: Area-time optimal division for T=omega((logn)1+epsilon), (1985)