Kurt Mehlhorn

Q: What Schools Are Affiliated With Kurt Mehlhorn

Kurt Mehlhorn is affiliated with the following schools: Saarland University, Drexel University, Cornell University, Technical University of Munich

Kurt Mehlhorn's AcademicInfluence.com Rankings

Kurt Mehlhorn

Computer Science

#225

World Rank

#234

Historical Rank

Database

#532

World Rank

#556

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Kurt Mehlhorn Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science. Education and career Mehlhorn graduated in 1971 from the Technical University of Munich, where he studied computer science and mathematics, and earned his Ph.D. in 1974 from Cornell University under the supervision of Robert Constable. Since 1975 he has been on the faculty of Saarland University in Saarbrücken, Germany, where he was chair of the computer science department from 1976 to 1978 and again from 1987 to 1989. Since 1990 has been the director of the Max Planck Institute for Computer Science, also in Saarbrücken. He has been on the editorial boards of ten journals, a trustee of the International Computer Science Institute in Berkeley, California, and a member of the board of governors of Jacobs University Bremen. He also served on the Engineering and Computer Science jury for the Infosys Prize from 2009 to 2011.

(See a Problem?)

Kurt Mehlhorn's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Weisfeiler-Lehman Graph Kernels (2011) (1440)
Efficient graphlet kernels for large graph comparison (2009) (844)
Faster algorithms for the shortest path problem (1990) (553)
Dynamic perfect hashing: upper and lower bounds (1988) (474)
Data Structures and Algorithms 1: Sorting and Searching (2011) (471)
Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry (2012) (412)
Congruence, similarity, and symmetries of geometric objects (1987) (293)
A Faster Approximation Algorithm for the Steiner Problem in Graphs (1988) (277)
Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness (1984) (275)
Algorithms and Data Structures: The Basic Toolbox (2008) (263)
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) (1982) (258)
Four Results on Randomized Incremental Constructions (1992) (203)
A Parallelization of Dijkstra's Shortest Path Algorithm (1998) (189)
Classroom Examples of Robustness Problems in Geometric Computations (2004) (176)
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) (1991) (175)
Pareto Optimality in House Allocation Problems (2005) (160)
Cycle bases in graphs characterization, algorithms, complexity, and applications (2009) (159)
Graph Algorithm and NP-Completeness (1984) (159)
Certifying algorithms (2011) (154)
Multi-dimensional searching and computational geometry (1984) (148)
A new data structure for representing sorted lists (1980) (143)
Resource Constrained Shortest Paths (2000) (142)
Certifying algorithms for recognizing interval graphs and permutation graphs (2003) (135)
Physarum can compute shortest paths (2011) (134)
Fast Triangulation of Simple Polygons (1983) (133)
External-Memory Breadth-First Search with Sublinear I/O (2002) (129)
Curve reconstruction: connecting dots with good reason (1999) (129)
Polynomial and abstract subrecursive classes (1974) (123)
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees (1986) (121)
Rank-maximal matchings (2004) (114)
Pebbling Moutain Ranges and its Application of DCFL-Recognition (1980) (114)
Dynamic fractional cascading (1990) (113)
Maintaining dynamic sequences under equality tests in polylogarithmic time (1994) (111)
Randomized Incremental Construction of Abstract Voronoi Diagrams (1993) (108)
Assigning Papers to Referees (2009) (106)
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (1990) (106)
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones (1986) (104)
On the program size of perfect and universal hash functions (1982) (104)
Additive spanners and (α, β)-spanners (2010) (99)
A platform for combinatorial and geometric computing (1995) (96)
Cost Trade-offs in Graph Embeddings, with Applications (1983) (94)
On degeneracy in geometric computations (1994) (93)
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients (2005) (92)
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings (2008) (91)
Checking geometric programs or verification of geometric structures (1996) (90)
On the Average Number of Rebalancing Operations in Weight-Balanced Trees (1980) (88)
Popular matchings (2005) (85)
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons (2002) (84)
A branch-and-cut algorithm for multiple sequence alignment (1997) (84)
Nearly optimal binary search trees (1975) (84)
A Best Possible Bound for the Weighted Path Length of Binary Search Trees (1977) (83)
Computing real roots of real polynomials (2013) (81)
EFX Exists for Three Agents (2020) (80)
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space (1990) (80)
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (1990) (79)
Routing through a rectangle (1986) (78)
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation (2003) (77)
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (1984) (75)
Counting Arbitrary Subgraphs in Data Streams (2012) (75)
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments (2007) (74)
On the construction of abstract voronoi diagrams (1990) (72)
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint (2000) (71)
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results (1994) (71)
Online graph exploration: New results on old and new algorithms (2012) (71)
Exact geometric computation in LEDA (1995) (70)
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces (2005) (70)
A Separation Bound for Real Algebraic Expressions (2001) (69)
Can A Maximum Flow be Computed on o(nm) Time? (1990) (68)
New constructions of (α, β)-spanners and purely additive spanners (2005) (66)
Dynamic Binary Search (1977) (66)
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (1996) (64)
A Little Charity Guarantees Almost Envy-Freeness (2019) (64)
New bounds for the Descartes method (2005) (63)
Data Structures (2020) (62)
Dynamic point location in general subdivisions (1992) (61)
A Faster Algorithm for Minimum Cycle Basis of Graphs (2004) (60)
Efficient exact geometric computation made easy (1999) (59)
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem (2004) (59)
Algorithms for dense graphs and networks on the random access computer (1996) (59)
Sorting Presorted Files (1979) (56)
An efficient graph algorithm for dominance constraints (2003) (56)
Certifying and repairing solutions to large LPs how good are LP-solvers? (2003) (55)
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees (1982) (55)
A combinatorial polynomial algorithm for the linear Arrow-Debreu market (2012) (53)
Approximating the Nash Social Welfare with Budget-Additive Valuations (2017) (53)
Smoothed Analysis of Three Combinatorial Problems (2003) (52)
Furthest Site Abstract Voronoi Diagrams (2001) (52)
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals (2000) (51)
Implementing minimum cycle basis algorithms (2005) (50)
Approximate Counting of Cycles in Streams (2011) (50)
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms (2011) (50)
On Fair Division of Indivisible Items (2018) (48)
The leda user manual (1996) (47)
Controlled perturbation for Delaunay triangulations (2005) (46)
A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem (1997) (46)
On continuous Homotopic one layer routing (1988) (45)
Optimal search for rationals (2003) (45)
From approximate factorization to root isolation with application to cylindrical algebraic decomposition (2013) (44)
The Implementation of Geometric Algorithms (1994) (44)
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (1984) (43)
On the Size of Sets of Computable Functions (1973) (43)
Randomized external-memory algorithms for some geometric problems (1998) (43)
TSP-based curve reconstruction in polynomial time (2000) (42)
Dynamic interpolation search (1985) (41)
Minimum cycle bases: Faster and simpler (2009) (41)
Sorting and Searching (1984) (40)
The LEDA class real number (1996) (39)
Exact geometric computation made easy (1999) (39)
Maintaining Discrete Probability Distributions Optimally (1993) (39)
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market (2015) (38)
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science) (1984) (38)
Dynamization of geometric data structures (1985) (35)
Routing Through a Generalized Switchbox (1985) (35)
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (2013) (35)
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron (1993) (34)
Fair Division of Indivisible Goods (2018) (34)
Matching Algorithms Are Fast in Sparse Random Graphs (2004) (34)
Algorithms and data structures (1984) (34)
A deterministic algorithm for isolating real roots of a real polynomial (2011) (33)
A Lower Bound for the Complexity of the Union-Split-Find Problem (1987) (33)
A Polynomial-Time Fragment of Dominance Constraints (2000) (33)
Exact Computation with leda_real - Theory and geometric Applications (2001) (32)
A Probabilistic Algorithm for Vertex Connectivity of Graphs (1982) (32)
The Query Complexity of Finding a Hidden Permutation (2013) (31)
The HILL system : a design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts (1983) (31)
On simultaneous inner and outer approximation of shapes (1990) (31)
SCIL - Symbolic Constraints in Integer Linear Programming (2002) (31)
A complete roundness classification procedure (1997) (31)
A Framework for the Verification of Certifying Computations (2013) (31)
Faster algorithms for computing Hong's bound on absolute positiveness (2010) (31)
Towards Optimal Multiple Selection (2005) (31)
A Lower Bound on the Complexity of the Union-Split-Find Problem (1988) (31)
Effective Computational Geometry for Curves and Surfaces (2005) (30)
LEDA-SM Extending LEDA to Secondary Memory (1999) (30)
A log log n Data Structure for Three-Sided Range Queries (1987) (29)
Polyline Fitting of Planar Points under Min-sum Criteria (2004) (29)
Pattern-Avoiding Access in Binary Search Trees (2015) (29)
An Amortized Analysis of Insertions into AVL-Trees (1986) (28)
Intersecting two polyhedra one of which is convex (1985) (28)
Codes: Unequal Probabilities, Unequal Letter Cost (1980) (28)
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees (1988) (28)
Traveling Salesman-Based Curve Reconstruction in Polynomial Time (2001) (28)
Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers (2009) (27)
A method for obtaining randomized algorithms with small tail probabilities (1996) (27)
An efficient algorithm for constructing nearly optimal prefix codes (1980) (27)
Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox (2019) (27)
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project (1992) (27)
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow (1999) (27)
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms (2001) (27)
Scanning Multiple Sequences via Cache Memory (2002) (27)
Data structures and algorithms. Volume 1 : Sorting and searching (1984) (27)
Lower Bounds for the Space Complexity of Context-Free Recognition (1976) (26)
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures (2002) (26)
Optimal Dynamization of Decomposable Searching Problems (1981) (26)
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step (2007) (25)
Improving EFX Guarantees through Rainbow Cycle Number (2021) (25)
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures (2000) (25)
Monotone switching circuits and boolean matrix product (1975) (25)
Reliable and Efficient Computational Geometry Via Controlled Perturbation (2006) (25)
Structural filtering: A paradigm for efficient and exact geometric programs (2005) (25)
A strong and easily computable separation bound for arithmetic expressions involving square roots (1997) (25)
Some remarks on Boolean sums (1979) (24)
Arrangements on Parametric Surfaces I: General Framework and Infrastructure (2010) (24)
On the Complexity of VLSI Computations (1981) (23)
Average-case complexity of shortest-paths problems in the vertex-potential model (1997) (23)
Look — a Lazy Object-Oriented Kernel for geometric computation (2000) (23)
An o(n³)-Time Algorithm Maximum-Flow Algorithm (1996) (23)
A language over a one symbol alphabet requiring only O (log log n) space (1975) (23)
The "Almost All" Theory of Subrecursive Degrees is Decidable (1974) (22)
Experiments on Curve Reconstruction (2000) (22)
Partial Match Retrieval in Implicit Data Structures (1981) (22)
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems (2001) (22)
On the Expected Depth of Random Circuits (1999) (21)
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs (2005) (21)
From Algorithms to Working Programs: On the Use of Program Checking in LEDA (1998) (21)
Robust Balancing in B-Trees (1981) (21)
Breaking the O(m2n) Barrier for Minimum Cycle Bases (2009) (21)
On the all-pairs shortest-path algorithm of Moffat and Takaoka (1997) (20)
A general approach to the analysis of controlled perturbation algorithms (2011) (20)
A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions (1982) (20)
The Recognition of Deterministic CFL's in Small Time and Space (1983) (20)
Checking priority queues (1999) (20)
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition (1992) (20)
Parallel Algorithms and Architectures (1987) (20)
An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs (2008) (20)
Best possible bounds for the weighted path length of optimum binary search trees (1975) (19)
New constructions of (alpha, beta)-spanners and purely additive spanners (2005) (19)
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract) (1978) (19)
Verification of Certifying Computations through AutoCorres and Simpl (2014) (19)
Compaction on the Torus (1988) (19)
A faster compaction algorithm with automatic jog insertion (1988) (19)
Binary Search Trees: Average and Worst Case Behavior (1976) (18)
Fair Matchings and Related Problems (2016) (18)
On local routing of two-terminal nets (1987) (18)
New Approximation Algorithms for Minimum Cycle Bases of Graphs (2007) (18)
A Note On Spectral Clustering (2015) (18)
Infimaximal Frames: A Technique for Making Lines Look Like Segments (2003) (17)
AT2-optimal VLSI integer division and integer square rooting (1984) (17)
A Generalized and improved constructive separation bound for real algebraic expressions (2000) (17)
Self-Adjusting Binary Search Trees: What Makes Them Tick? (2015) (17)
Exact Algorithms for a Geometric Packing Problem (Extended Abstract) (1993) (16)
Multidimensional Data Structures (1984) (16)
Space sweep solves intersection of convex polyhedra (1984) (16)
An Õ(mn) Algorithm for Minimum Cycle Basis of Graphs∗ (2004) (16)
Verification of Certifying Computations (2011) (16)
The landscape of bounds for binary search trees (2016) (15)
Bracket-Languages are Recognizable in Logarithmic Space (1976) (15)
Fast Triangulation of the Plane with Respect to Simple Polygons (1985) (15)
Arbitrary Weight Changes in Dynamic Trees (1981) (15)
Simultaneous inner and outer approximation of shapes (2005) (15)
Algorithms to Compute Minimum Cycle Basis in Directed Graphs (2007) (15)
Network Problems with Non-Polynomial Weights And Applications (2005) (15)
CNOP - A Package for Constrained Network Optimization (2001) (15)
Certifying 3-Edge-Connectivity (2012) (15)
Routing Problems in Grid Graphs (1989) (15)
On the complexity of a game related to the dictionary problem (1989) (14)
The Query Complexity of a Permutation-Based Variant of Mastermind (2018) (14)
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka (1995) (14)
Sorting Jordan sequences in linear time (1985) (14)
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (2006) (14)
Earning Limits in Fisher Markets with Spending-Constraint Utilities (2017) (13)
An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm (1993) (13)
New Approximability Results for the Robust k-Median Problem (2013) (13)
CHAPTER 6 – Data Structures (1990) (13)
A Fast Algorithm for Renaming a Set of Clauses as a Horn Set (1985) (13)
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm (1999) (13)
Optimal Algorithms for Generating Discrete Random Variables with Changing Distributions (1992) (13)
From approximate factorization to root isolation (2013) (12)
Isolating real roots of real polynomials (2009) (12)
Lower bounds for set intersection queries (1993) (12)
Runtime prediction of real programs on real machines (1997) (12)
Two Results on Slime Mold Computations (2017) (12)
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection (1993) (12)
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design (2014) (12)
Faster Algorithms for Minimum Cycle Basis in Directed Graphs (2008) (12)
The Reliable Algorithmic Software Challenge RASC (2003) (11)
Parsing Macro Grammars Top Down (1979) (11)
Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) (1987) (11)
On the Construction of Abstract Voronoi Diagrams, II (1990) (11)
Computing Equilibria in Markets with Budget-Additive Utilities (2016) (11)
A computational basis for higher-dimensional computational geometry and applications (1997) (10)
Cycle bases of graphs and sampled manifolds (2007) (10)
Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration (2013) (10)
Algorithms for routing in planar graphs (1986) (10)
An efficient algorithm for the configuration problem of dominance graphs (2001) (10)
Dynamic data structures (1979) (9)
Strongly Stable Matchings in Time O ( nm ) (2003) (9)
The cost of address translation (2012) (9)
Dynamic Deferred Data Structuring (1990) (9)
Introducing the slime mold graph repository (2017) (9)
All-pairs shortest-paths computation in the presence of negative cycles (2002) (9)
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs (1994) (9)
AT²-Optimal Galois Field Multiplier for VLSI (1989) (9)
On a Model of Virtual Address Translation (2015) (9)
Multi-finger binary search trees (2018) (9)
Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves (1991) (9)
Convergence of the Non-Uniform Physarum Dynamics (2019) (9)
LEDA-Manual Version 3.0 (1993) (8)
Controlled Perturbation for Voronoi Diagrams (2004) (8)
I/O-optimal computation of segment intersections (1999) (8)
Greedy Is an Almost Optimal Deque (2015) (8)
Visualization of Points and Segments of Real Algebraic Plane Curves (2007) (8)
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets (1993) (8)
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs (2012) (8)
Compaction on the torus [VLSI layout] (1990) (7)
Exact geometric computation (2001) (7)
Engineering DFS-Based Graph Algorithms (2017) (7)
A Deterministic Descartes Algorithm for Real Polynomials (2008) (7)
Channel routing in knock-knee mode: Simplified algorithms and proofs (1986) (7)
Space sweep solves intersection of two convex polyhedra elegantly (1984) (7)
Four results on the complexity of VLSI computations (1983) (7)
On the performance of LEDA-SM (1998) (7)
Maximizing Nash Social Welfare in 2-Value Instances (2021) (7)
Satiation in Fisher Markets and Approximation of Nash Social Welfare. (2017) (7)
AT2-Optimal Galois Field Multiplier for VLSI (1986) (7)
Hidden Line Elimination for Isooriented Rectangels (1990) (7)
Cache-Oblivious and Cache-Aware Algorithms (2005) (7)
Characterizing networks formed by P. polycephalum (2017) (7)
LEDA-SM a platform for secondary memory computations (1999) (7)
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version) (1981) (7)
LOOK: A Lazy Object-Oriented Kernel design for geometric computation (2002) (6)
Convergence of the Non-Uniform Directed Physarum Model (2019) (6)
Searching, Sorting and Information Theory (1979) (6)
Approximate Spectral Clustering: Efficiency and Guarantees (2015) (6)
EFX Allocations: Simplifications and Improvements (2022) (6)
Physarum-inspired multi-commodity flow dynamics (2020) (6)
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves (2018) (6)
Searching Semisorted Tables (1985) (6)
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms (2004) (5)
A Communication-Randomness Tradeoff for Two-Processor Systems (1995) (5)
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets (2013) (5)
Maximum Network Flow with Floating Point Arithmetic (1998) (5)
Area-Time Optimal Division for T=f2( (log n)' +')* (1987) (5)
A Lower Bound for Area-Universal Graphs (1994) (5)
A Remark on the Sign Variation Method for Real Root Isolation (2001) (5)
Progress on Certifying Algorithms (2010) (5)
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (2013) (5)
Earning and Utility Limits in Fisher Markets (2019) (5)
Tail estimates for the space complexity of randomized incremental algorithms (1992) (5)
CertiVed Numerical Root Finding (2011) (5)
Algorithms for dense graphs and networks (1991) (5)
A still simpler way of introducing interior-point method for linear programming (2014) (5)
A Time-Randomness Tradeoff for Communication Complexity (1991) (5)
Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science (1984) (5)
Intersecting a line and a simple polygon (1984) (4)
An Introduction to Certifying Algorithms (2011) (4)
Area-time Optimal Division for T=Omega(log n)1+epsilon (1986) (4)
A Single Shortest Path Algorithm for Graphs with Separators (1983) (4)
Graph Traversal (2019) (4)
Randomized construction diagrams* incremental of abstract Voronoi (1993) (4)
Minimum Cycle Basis, Algorithms & Applications (2006) (4)
A Linear-Time Certifying Triconnnectivity Algorithm for Hamiltonian Graphs (2010) (4)
Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452) (2013) (4)
Automata, Languages, and Programming (2012) (4)
Improved balanced flow computation using parametric flow (2015) (4)
The LEDA class real number - extended version (2004) (4)
Sweeping and maintaining two-dimensional arrangements on quadrics (2007) (4)
Trustworthy Graph Algorithms (Invited Talk) (2019) (4)
Fair Division of Indivisible Goods for a Class of Concave Valuations (2022) (3)
Certifying Algorithms (A Paper under Construction) (2005) (3)
Point containment in the integer hull of a polyhedron (2004) (3)
On BF-orderable graphs (1986) (3)
Explorer Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min ( Max ) Polynomial (2014) (3)
Constraint Programming and Graph Algorithms (2000) (3)
Local Routing of Two-terminal Nets is Easy (1984) (3)
Cache-Oblivious VAT-Algorithms (2014) (3)
An empirical comparison of software for constructing arrangements of curved arcs (2004) (3)
Trustworthy Graph Algorithms (2019) (3)
Nash Social Welfare for 2-value Instances (2021) (3)
Lower bounds on the efficiency of transforming static data structures into dynamic structures (1981) (3)
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361] (2009) (3)
Distance Computation for Extended Quadratic Complexes (2005) (3)
Implementation of $O(nm \log n)$ weighted matchings: The power of data structures (2000) (2)
Proceedings of the 16th annual European symposium on Algorithms (2008) (2)
Upper and Lower Bounds for the Dictionary Problem (1988) (2)
Proceedings of the International Workshop on Parallel Algorithms and Architectures (1987) (2)
Upper and Lower Bounds for the Dictionary Problem (Abstract) (1988) (2)
Geometric Computing with CGAL and LEDA (2000) (2)
German e-Science Conference 2007 (2007) (2)
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683] (2018) (2)
Path Problems in Graphs and Matrix Multiplication (1984) (2)
VLSI complexity, efficient VLSI algorithms and the HILL design system (1983) (2)
Generic Approaches to Optimization (2019) (2)
Physarum Multi-Commodity Flow Dynamics (2020) (2)
Smoothed analysis of three combinatorial algorithms (2003) (2)
Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II (2012) (2)
Parallel algorithms and architectures : International Workshop, Suhl, GDR, May 25-30, 1987, proceedings (1987) (2)
Foundations of programming languages (1988) (2)
On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs (1979) (2)
Position Paper for Panel Discussion (1996) (2)
Van wijngaarden grammars and space complexity class EXSPACE (1977) (2)
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 (2005) (2)
A of Efficient Data Types and Algorithms (1989) (2)
An Improved Lower Bound on the Formula Complexity of Context-free Recognition (1976) (2)
Multiplication of Long Integers - Faster than Long Multiplication (2011) (1)
On Continuous Homotopic One Layer Routing (Extended Abstract) (1988) (1)
Combinatorial Algorithms for General Linear Arrow-Debreu Markets (2018) (1)
Fair Matchings and Related Problems (2015) (1)
Towards an open online repository of P. polycephalum networks and their corresponding graph representations (2016) (1)
Computational Geometry (Dagstuhl Seminar 11111) (2011) (1)
Approximation algorithms for geometric optimization problems (2008) (1)
Complexity arguments in algebraic language theory (1979) (1)
A simple way to recognize a correct Voronoi diagram of line segments (1999) (1)
Market Equilibrium Computation for the Linear Arrow-Debreu Model (2016) (1)
The Deterministic and Randomized Query Complexity of a Simple Guessing Game (2012) (1)
Experiences with the Implementation of Geometric Algorithms (Abstract) (1995) (1)
Two Versus One Index Register and Modifiable Versus Non-modifiable Programs (1989) (1)
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions (2016) (1)
Ratio-Balanced Maximum Flows (2019) (1)
Graph-Theoretic Concepts in Computer Science (1993) (1)
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design (2016) (1)
Weak and Strong ε-Nets for Geometric Range Spaces (2009) (1)
Opposition Frameworks (2016) (1)
IFIP World Computer Congress on Fundamentals - Foundations of Computer Science (1998) (1)
Representing Sequences by Arrays and Linked Lists (2019) (1)
Physarum Computations (Invited talk) (2013) (1)
On testing substitutability (2018) (1)
Granularity of Memory in Parallel Computation (1983) (1)
Algorithmic Aspects of Abstract Argumentation Frameworks (2012) (1)
Advanced graph kernels: Graphlet Kernels (2010) (1)
Leda 2 Part Set: A Platform for Combinatorial and Geometric Computing (2009) (1)
Hash Tables and Associative Arrays (2019) (1)
Reliable and Efficient Geometric Computing (2006) (1)
Rank-maximal matchings (2004) (1)
Computing Real Roots of Real Polynomials - An Ecient Method Based on Descartes' Rule of Signs and (2014) (1)
Minimum Cycle Bases in Graphs Algorithms and Applications (2007) (1)
Faster Randomized and Deterministic Algorithms for Minimum Cycle Bases in Directed Graphs ∗ (2006) (1)
Improved Minimum Cycle Bases Algorithms by Restriction to Isometric Cycles (2011) (1)
Data Structures and Algorithms III (1990) (1)
Remarks on Category-Based Routing in Social Networks (2012) (1)
Selected papers from the 12th annual symposium on Computational Geometry (1999) (1)
A Global Geometric View of Splaying (2015) (1)
Fundamentals - Foundations of Computer Science (1998) (1)
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms (2013) (1)
Certifying 3-Edge-Connectivity (2015) (1)
Linear Programming and Integer Linear Programming (2013) (1)
Geometric Rounding without changing the Topology (2003) (0)
Proc. of an international workshop on Parallel algorithms and architectures (1987) (0)
Appetizer: Integer Arithmetic (2019) (0)
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science (1985) (0)
Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract) (1992) (0)
Editor’s Note: Special Section on Computing and Combinatorics (2015) (0)
Algorithms and Programs Erasmus Lecture 2014 (2015) (0)
Load Balancing (2019) (0)
Experiences with the implementation of geometric algorithms (1995) (0)
New Optimization Algorithms in Physics (Dagstuhl Seminar 03381) (2021) (0)
Noise-induced network topologies (2022) (0)
Acknowledgement to referees (2005) (0)
D S ] 2 7 Ju l 2 01 8 Two Results on Slime Mold Computations (2018) (0)
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets (2014) (0)
Selected Topics from Computational Geometry, Data Structures and Motion Planning (1992) (0)
Basic Notions of Point Set Topology, Metric Spaces and the PL-category (2004) (0)
2 The landscape of bounds for binary search trees (2016) (0)
From Algorithm to Program to Software Library (2001) (0)
Sorting and Selection (2019) (0)
Improving Order with Queues (2022) (0)
On BF-perfect graphs (1985) (0)
Interplay of periodic dynamics and noise: Insights from a simple adaptive system. (2021) (0)
Fundamentals - Foundations of Computer Science, IFIP World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary (1998) (0)
Top down parsing of macro grammars (preliminary report) (1976) (0)
Top Down Parsing of Macro Grammars (1976) (0)
An O(n log n) lower bound for the synchronous circuit size of integer multiplication (1976) (0)
Symboli Constraints in Integer LinearProgramming ? (2008) (0)
Fundamentals-foundations of computer science : proceedings of the XV. IFIP World Computer Congress, 31 August - 4 September 1998, Vienna/Austria and Budapest/Hungury (1998) (0)
2nd Workshop on Algorithm Engineering WAE '98 -- Proceedings (1998) (0)
Special issue on algorithms: implementation, libraries and use (1994) (0)
Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994 (1994) (0)
Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989 (1989) (0)
Chapter 10. Challenges in Algorithm Engineering (0)
STACS 85 : 2nd Annual Symposium on Theoretical Aspects of Computer Science, Saarbrücken, January 3-5, 1985 (1985) (0)
Data Structures and Algorithms (Summer 2008) Contents (2008) (0)
How to Cope with NP-Completeness (2013) (0)
List for Algorithms and Data Structures Summer 2008 Kurt Mehlhorn and Raimund Seidel August (2008) (0)
Proceedings of the Fifth Annual Symposium on Computational Geometry 1989 (SCG '89) (1989) (0)
An (O)over-tilde (m(2)n) Algorithm for Minimum Cycle Basis of Graphs (2008) (0)
Smoothed Analysis of Three Combinatorial ProblemsCyril (2003) (0)
Some Generalizations of Least-Squares Algorithms (2008) (0)
Shortest Paths in Time-Dependent Networks ant their Applications (2005) (0)
D S ] 1 2 O ct 2 01 1 Physarum Can Compute Shortest Paths ∗ (2018) (0)
Acknowledgement to Referees (2001) (0)
Proceedings of STACS 84-symposium on theoretical aspects of computer science (1984) (0)
A Heuristi for Dijkstra ' s Algorithm with ManyTargets and its Use in Weighted Mat hingAlgorithms ? (2003) (0)
Reliable Geometric Computing (2006) (0)
P. polycephalum Can Compute Shortest Paths (2016) (0)
Incremental Computation and Dynamic Algorithms (Dagstuhl Seminar 9418) (2021) (0)
Granularity of Parallel Memories (2011) (0)
On the Implementation of Combinatorial Algorithms for the Linear Exchange Market (2015) (0)
Benchmark Data Sets for Conic Arrangements (2005) (0)
Computational Learning Theory (2013) (0)
INTERNATIONAL SCHOOL OF MATHEMATICS «GUIDO STAMPACCHIA» 56th Workshop: GRAPH THEORY, ALGORITHMS AND APPLICATIONS (2008) (0)
Equilibrium Computation (Dagstuhl Seminar 14342) (2014) (0)
Book List for Algorithms and Data Structures Summer 2008 (2008) (0)
LEDA + Algorithm = Program (2000) (0)
Cache-Oblivious and Cache-Aware Algorithms Dagstuhl Seminar (2005) (0)
Minimum Spanning Trees (2019) (0)
The Physarum Computer (2011) (0)
Computational Geometry (Dagstuhl Seminar 13101) (2013) (0)
Proc. of the Aegean workshop on computing on VLSI algorithms and architectures (1986) (0)
Bloom Filters and Locality-Sensitive Hashing (2016) (0)
VLSI Algorithms and Architectures (1986) (0)
Edinburgh Research Explorer Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (2014) (0)
Algorithms for Complex Shapes with Certified Numerics and Topology A deterministic Bitstream Descartes Algorithm (2008) (0)
On a journey of discovery in the digital world | MaxPlanckResearch 3/2018: The Origin of Life (2018) (0)
Reply to "Backward Error Analysis ..." (2006) (0)
Community Analysis Using Local Random Walks (2013) (0)
Parallel algorithms and architectures : proceedings of the International Workshop on Parallel Algorithms and Architectures held in Suhl(GDR), May 25-30, 1987 (1987) (0)
Stacs 84: Symposium of Theoretical Aspects of Computer Science, Paris April 11-13, 1984 (1984) (0)
Matchings in Graphs Variations of the Problem (2007) (0)
Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings (1998) (0)
Dagstuhl-seminar 01121, ''computational Geometry'' Three-dimensional Mesh Generation for Domains with Small Angles a Separation Bound for Real Algebraic Expressions (0)
The Maximum-Level Vertex in an Arrangement of Lines (2020) (0)
Lecture 5: Data Streaming Algorithms (2013) (0)
Algorithms , Complexity and Machine Learning : A Tribute to Kurt Mehlhorn (2014) (0)
Equilibrium Computation (2014) (0)
Ten Years of LEDA Some Thoughts (Abstract) (1999) (0)
Performance Analysis of Single Source Shortest Path Algorithm over Multiple GPUs in a Network of Workstations using OpenCL and MPI (2019) (0)
Dynamic Binary Search Trees : Extended Abstracts (1976) (0)
Minimum Cycle Bases and Surface Reconstruction (2005) (0)
Programs with Recursively Defined Data Structures (Dagstuhl Seminar 98161) (2021) (0)
On Optimal VLSI-Circuits for the Basic Arithmetic Functions (1984) (0)
An Ecien t Graph Algorithm for Dominance Constraints 1 (2003) (0)
Selected Topics in Algorithms 2009 NP-completeness of Minimum Fundamental Cycle Basis Problem (2009) (0)
An EÆ ient Algorithm for the Con guration Problemof Dominan e Graphs 1 (2007) (0)
Algorithms for Equilibrium Prices in Linear Market Models (2014) (0)
The Cost of Address Translation Extended (2012) (0)
Guest Editorial: Selected Papers from European Symposium on Algorithms (2011) (0)
TSP-Based Curve Re onstru tion in Polynomial TimeErnst (2000) (0)
Collective Communication and Computation (2019) (0)
Report on the Dagstuhl-Seminar on Incremental Computation and Dynamic Algorithms (1994) (0)
From Theory to Library of Efficient Data Types and Algorithms (LEDA) and Algorithm Engineering (2015) (0)
Coordination Mechanisms for Unrelated Machine Scheduling (2011) (0)
SERIE B INFORMATIK Dynamic Point Location in General Subdivisions (2009) (0)
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs (2010) (0)
Acknowledgment: We Would like to Thank Theorem 5.1 (a Stopping Point for the Cs) for a List of N Items with the Probability Vector (0)
Markov Chains : Graph Connectivity , Satisfiability , Rapid Mixing , Gambler ’ s Ruin , Move-To-Front (2016) (0)
Graph and Hashing Algorithms for Modern Ar hite tures (2007) (0)
Algorithms and Programs (2016) (0)
Implementation and Experimental Evaluation of a Combinatorial Min-Cost Flow Algorithm (2015) (0)
A game on graphs (1975) (0)
2 9 Ju l 2 01 8 Approximate Spectral Clustering : Efficiency and Guarantees ∗ (2018) (0)
Complete roundness classification procedure (1999) (0)
Proceedings of the VLSI Algorithms and Architectures, Aegean Worksho on Computing (1986) (0)
Acknowledgement to referees (2004) (0)
The Engineering of Some Bipartite Matching Programs (1999) (0)
A Framework for the Verification of Certifying Computations (2013) (0)
k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs (1992) (0)
Maximal Common Subgraph DAGs: Theory and Application to Virtual Screening in Drug Development (2011) (0)
Algorithms on Graphs (1984) (0)
Quicksort and Randomized Incremental Constructions (2016) (0)

This paper list is powered by the following services:

Other Resources About Kurt Mehlhorn

en.wikipedia.org

What Schools Are Affiliated With Kurt Mehlhorn?

Kurt Mehlhorn is affiliated with the following schools:

Kurt Mehlhorn's Academic­Influence.com Rankings