What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Combinatorics
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 most cited work include:
- LEDA: A Platform for Combinatorial and Geometric Computing (933 citations)
- Weisfeiler-Lehman Graph Kernels (857 citations)
- Efficient Graphlet Kernels for Large Graph Comparison (554 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (38.43%)
- Discrete mathematics (29.17%)
- Algorithm (23.92%)
What were the highlights of his more recent work (between 2012-2021)?
- Combinatorics (38.43%)
- Discrete mathematics (29.17%)
- Theoretical computer science (12.19%)
In recent papers he was focusing on the following fields of 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.
Between 2012 and 2021, his most popular works were:
- Computing real roots of real polynomials (54 citations)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (34 citations)
- A combinatorial polynomial algorithm for the linear Arrow-Debreu market (32 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Combinatorics
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.
