2023 - Research.com Computer Science in Germany Leader Award
2016 - European Association for Theoretical Computer Science (EATCS) Fellow For his influential contribution to the whole field of algorithmics over the past decades. In addition to key theoretical contributions, he has brought basic research closer to practice
2015 - Member of the National Academy of Sciences
2014 - Member of the National Academy of Engineering For contributions to algorithm design and the development of the LEDA software library.
2010 - ACM Paris Kanellakis Theory and Practice Award For contributions to algorithm engineering by creating the LEDA library for algorithmic problem solving.
2004 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
1999 - ACM Fellow For important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms.
1995 - Member of Academia Europaea
Fellow of the Indian National Academy of Engineering (INAE)
Kurt Mehlhorn mainly investigates Combinatorics, Discrete mathematics, Algorithm, Time complexity and Data structure. His Combinatorics research incorporates elements of Set, Sequence and Theory of computation. He combines subjects such as Binary search tree, Random binary tree, Voronoi diagram and Constant with his study of Discrete mathematics.
His research integrates issues of Routing, Mathematical proof, Mathematical optimization and Integer in his study of Algorithm. Kurt Mehlhorn has researched Time complexity in several fields, including Spanner, Multiplicative function, Computational complexity theory, Shortest path problem and Approximation algorithm. The study incorporates disciplines such as Simple, Theoretical computer science, Computer graphics and Pattern recognition in addition to Data structure.
His main research concerns Combinatorics, Discrete mathematics, Algorithm, Theoretical computer science and Time complexity. His studies in Combinatorics integrate themes in fields like Matching, Upper and lower bounds and Sequence. His Discrete mathematics research is multidisciplinary, relying on both Voronoi diagram, Polynomial and Computation.
His biological study spans a wide range of topics, including Leda, Cycle basis and Data structure. His study ties his expertise on Cycle space together with the subject of Cycle basis. Shortest Path Faster Algorithm and Yen's algorithm are the primary areas of interest in his Shortest path problem study.
Kurt Mehlhorn spends much of his time researching Combinatorics, Discrete mathematics, Theoretical computer science, Data structure and Mathematical economics. His Combinatorics research is multidisciplinary, incorporating perspectives in Matching and Upper and lower bounds. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Arrow–Debreu model and Splay tree.
Kurt Mehlhorn studied Theoretical computer science and Graph that intersect with Null graph and Line graph. His Data structure study combines topics from a wide range of disciplines, such as Linear programming and Mathematical optimization. His research in Mathematical economics intersects with topics in Variety, Computation, Set and General equilibrium theory.
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Graph, Mathematical economics and Data structure. His studies deal with areas such as Upper and lower bounds, Balanced flow and Arrow–Debreu model as well as Combinatorics. His study of Minimum degree spanning tree is a part of Discrete mathematics.
The various areas that Kurt Mehlhorn examines in his Graph study include Power iteration, Network formation and Theoretical computer science. Kurt Mehlhorn works mostly in the field of Mathematical economics, limiting it down to topics relating to Set and, in certain cases, Simple, Conjecture, Polynomial time approximation algorithm, Implementation and Certificate, as a part of the same area of interest. His Data structure study incorporates themes from Parallel algorithm, Value, Toolbox and Sequential access.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
LEDA: A Platform for Combinatorial and Geometric Computing
Kurt Mehlhorn;Stefan Näher.
Data Structures and Algorithms 1: Sorting and Searching
Weisfeiler-Lehman Graph Kernels
Nino Shervashidze;Pascal Schweitzer;Erik Jan van Leeuwen;Kurt Mehlhorn.
Journal of Machine Learning Research (2011)
Faster Algorithms for the Shortest Path Problem
Ravindra K. Ahuja;Kurt Mehlhorn;James Orlin;Robert E. Tarjan.
Efficient Graphlet Kernels for Large Graph Comparison
Nino Sherashidze;S. V. N. Vishwanathan;Tobias H. Petri;Kurt Mehlhorn.
international conference on artificial intelligence and statistics (2009)
The LEDA Platform of Combinatorial and Geometric Computing
Kurt Mehlhorn;Stefan Näher;Christian Uhrig.
international colloquium on automata languages and programming (1997)
Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness
Kurt Mehlhorn;Wilfried Brauer;Grzegorz Rozenberg;Arto Salomaa.
Dynamic Perfect Hashing: Upper and Lower Bounds
Martin Dietzfelbinger;Anna Karlin;Kurt Mehlhorn;Friedhelm Meyer auf der Heide.
SIAM Journal on Computing (1994)
Data Structures and Algorithms 3 : Multi-dimensional Searching and Computational Geometry
Algorithms and Data Structures: The Basic Toolbox
Kurt Mehlhorn;Peter Sanders.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: