Kurt Mehlhorn
Kurt Mehlhorn
Professor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus
Verified email at - Homepage
Cited by
Cited by
Weisfeiler-lehman graph kernels.
N Shervashidze, P Schweitzer, EJ Van Leeuwen, K Mehlhorn, ...
Journal of Machine Learning Research 12 (9), 2011
Data structures and algorithms: 1. Searching and sorting
K Mehlhorn
Springer 84, 90, 1984
LEDA, a platform for combinatorial and geometric computing
S Näher
Handbook of Data Structures and Applications, 653-666, 2018
Efficient graphlet kernels for large graph comparison
N Shervashidze, SVN Vishwanathan, T Petri, K Mehlhorn, K Borgwardt
Artificial intelligence and statistics, 488-495, 2009
Faster algorithms for the shortest path problem
RK Ahuja, K Mehlhorn, J Orlin, RE Tarjan
Journal of the ACM (JACM) 37 (2), 213-223, 1990
Algorithms and data structures: The basic toolbox
K Mehlhorn, P Sanders, P Sanders
Springer 55, 56, 2008
Dynamic perfect hashing: Upper and lower bounds
M Dietzfelbinger, A Karlin, K Mehlhorn, F Meyer Auf Der Heide, H Rohnert, ...
SIAM Journal on Computing 23 (4), 738-761, 1994
A faster approximation algorithm for the Steiner problem in graphs
K Mehlhorn
Information Processing Letters 27 (3), 125-128, 1988
Congruence, similarity, and symmetries of geometric objects
H Alt, K Mehlhorn, H Wagener, E Welzl
Discrete & Computational Geometry 3 (3), 237-256, 1988
Las Vegas is better than determinism in VLSI and distributed computing
K Mehlhorn, EM Schmidt
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
K Mehlhorn, U Vishkin
Acta Informatica 21, 339-374, 1984
A new data structure for representing sorted lists
S Huddleston, K Mehlhorn
Acta informatica 17, 157-184, 1982
Fast triangulation of the plane with respect to simple polygons
S Hertel, K Mehlhorn
Information and control 64 (1-3), 52-76, 1985
Computing a maximum cardinality matching in a bipartite graph in time O (n1. 5mlog n)
H Alt, N Blum, K Mehlhorn, M Paul
Information Processing Letters 37 (4), 237-240, 1991
A parallelization of Dijkstra's shortest path algorithm
A Crauser, K Mehlhorn, U Meyer, P Sanders
Mathematical Foundations of Computer Science 1998: 23rd International …, 1998
Classroom examples of robustness problems in geometric computations
L Kettner, K Mehlhorn, S Pion, S Schirra, C Yap
Computational Geometry 40 (1), 61-78, 2008
Popular matchings
DJ Abraham, RW Irving, T Kavitha, K Mehlhorn
SIAM Journal on Computing 37 (4), 1030-1045, 2007
Certifying algorithms
RM McConnell, K Mehlhorn, S Näher, P Schweitzer
Computer Science Review 5 (2), 119-161, 2011
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
Cycle bases in graphs characterization, algorithms, complexity, and applications
T Kavitha, C Liebchen, K Mehlhorn, D Michail, R Rizzi, T Ueckerdt, ...
Computer Science Review 3 (4), 199-243, 2009
The system can't perform the operation now. Try again later.
Articles 1–20