MOSTLY COMPLEXITY THEORY: 1973 14 FOCS Mehlhorn, On the Size of Sets of Computable Functions 1974 2 ICALP Mehlhorn, The `Almost All' Theory of Subrecursive Degrees is Decidable 1974 STOC Mehlhorn, Polynomial and Abstract Subrecursive Classes 1975 4 MFCS Mehlhorn & Galil, Monotone Switching Circuits and Boolean Matrix Product 1975 7 SIGACTN Alt & Mehlhorn, A Language over a One Symbol Alphabet Requiring only O(log log n) Space 1976 12 JCSS Mehlhorn, Polynomial and Abstract Subrecursive Classes 1976 3 ICALP Alt & Mehlhorn, Lower Bounds for the Space Complexity of Context-free Recognition 1976 5 IPL Mehlhorn, Bracket-Languages are Recognizable in Logarithmic Space 1977 4 ICALP Mehlhorn, Dynamic Binary Search 1977 6 SICOMP Mehlhorn, A Best Possible Bound for the Weighted Path Length of Binary Search Trees 1977 8 ACTAINF Deussen & Mehlhorn, Van Wijngarden Grammars and Space Complexity Class EXSPACE 1978 5 ICALP Altenkamp & Mehlhorn, Codes: Unequal Probabilities, Unequal Letter Costs 1978 TR Mehlhorn, Arbitrary Weight changes in Dynamic Trees 1979 12 ACTAINF Mehlhorn, Some Remarks on Boolean Sums 1979 8 MFCS Mehlhorn, Searching, Sorting and Information Theory 1979 8 MFCS Mehlhorn, Some Remarks on Boolean Sums 1979 8 SICOMP Mehlhorn, Dynamic Binary Search 1979 TR Mehlhorn, Pebbling a Mountain Range with O((log n)^2/log log n) Space and Polynomial Time Simultaneously MOSTLY ALGORITHMS AND DATA STRUCTURES: 1980 11 TCS Blum & Mehlhorn, On the Average Number of Rebalancing Operations in Weight-Balanced Trees 1980 26 IEEETIT Mehlhorn, An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes 1980 27 JACM Altenkamp & Mehlhorn, Codes: Unequal Probabilities, Unequal Letter Costs 1980 7 ICALP Mehlhorn, Pebbling Mountain Ranges and its Application to DCFL-Recognition 1980 MCT Mehlhorn, Dynamic Data Structures 1980 WG Mehlhorn, A New Data Structure for Representing Sorted Lists 1981 10 MFCS Alt & Mehlhorn & Munro, Partial Match Retrieval in Implicit Data Structures 1981 12 IPL Mehlhorn & Overmars, Optimal Dynamization of Decomposable Searching Problems 1981 15 MST Mehlhorn, Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures 1981 5 GITCS Huddleston & Mehlhorn, Robust Balancing in B-Trees 1981 8 ICALP Hong & Mehlhorn & Rosenberg, Cost Tradeoffs in Graph Embeddings, with Applications 1982 11 SICOMP Mehlhorn, A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions 1982 15 IPL Becker & Degenhardt & Doenhardt & Hertel & Kaninke & Kerber & Mehlhorn & Naher & Rohnert & Winter, A Probabilistic Algorithm for Vertex Connectivity of Graphs 1982 17 ACTAINF Huddleston & Mehlhorn, A New Data Structure for Representing Sorted Lists 1982 23 FOCS Mehlhorn, On the Program Size of Perfect and Universal Hash Functions 1982 55 INFCTRL Eisenbarth & Ziviani & Gonnet & Mehlhorn & Wood, The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees 1982 STOC Mehlhorn & Schmidt, Las Vegas Is Better than Determinism in VLSI and Distributed Computing 1983 30 JACM Hong & Mehlhorn & Rosenberg, Cost Trade-Offs in Graph Embedding with Applications 1983 4 FCT Hertel & Mehlhorn, Fast Triangulation of Simple Polygons 1983 4 FCT Mehlhorn & Schmidt, A Single Source Shortest Path Algorithm for Graphs with Separators 1983 56 INFCTRL von Braunmuhl & Cook & Mehlhorn & Verbeek, The Recognition of Deterministic CFLs in Small Time and Space 1983 58 INFCTRL Mehlhorn & Preparata, Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time 1984 11 ICALP Mehlhorn & Preparata, Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time 1984 19 IPL Alt & Mehlhorn & Munro, Partial Match Retrieval in Implicit Data Structures 1984 21 ACTAINF Hertel & Mantyla & Mehlhorn & Nievergelt, Space Sweep Solves Intersection of Convex Polyhedra 1984 21 ACTAINF Mehlhorn & Vishkin, Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories 1984 22 BEATCS Hoffmann & Mehlhorn, Intersecting a Line and a Simple Polygon 1984 3 EATCSMTCS Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching 1984 3 EATCSMTCS Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness 1984 3 EATCSMTCS Mehlhorn, Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry 1985 12 ICALP Kaufmann & Mehlhorn, Routing through a Generalized Switchbox 1985 12 ICALP Mehlhorn & Tsakalidis, Dynamic Interpolation Search 1985 14 SICOMP Alt & Mehlhorn, Searching Semisorted Tables BEGINS WORKING ON COMP GEOM. 1985 1 COMPGEOM Fries & Mehlhorn & St. Naher, Dynamization of Geometric Data Structures 1985 1 COMPGEOM Hoffmann & Mehlhorn & Rosenstiehl & Tarjan, Sorting Jordan Sequences in Linear Time 1985 21 IPL Mannila & Mehlhorn, A Fast Algorithm for Renaming a Set of Clauses as a Horn Set 1985 5 FCT Mehlhorn & Simon, Intersecting Two Polyhedra One of Which is Convex 1985 64 INFCTRL Hertel & Mehlhorn, Fast Triangulation of the Plane with Respect to Simple Polygons 1986 12 MFCS Alt & Hagerup & Mehlhorn & Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones 1986 15 DAMATH Mehlhorn & Schmidt, On BF-orderable Sets 1986 15 SICOMP Mehlhorn & Tsakalidis, An Amortized Analysis of Insertions into AVL-Trees 1986 1 ALGRTHMICA Mehlhorn & Preparata & Sarrafzadeh, Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs 1986 23 ACTAINF Becker & Mehlhorn, Algorithms for Routing in Planar Graphs 1986 23 IPL Rytter, An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-driven Languages 1986 33 JACM Mehlhorn & Preparata, Routing through a Rectangle 1986 3 STACS Mehlhorn & Preparata, Area-Time Optimal Division for T = Omega((log n)^{1+e}) 1986 68 INFCTRL Hoffmann & Mehlhorn & Rosentiehl & Tarjan, Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees 1986 7 ALGORITHMS Kaufmann & Mehlhorn, Routing through a Generalized Switchbox 1986 AWOC Furer & Mehlhorn, AT^2-Optimal Galois Field Multiplier for VLSI 1987 14 ICALP Mehlhorn & Naher & Alt, A Lower Bound for the Complexity of the Union-Split-Find Problem 1987 16 SICOMP Alt & Hagerup & Mehlhorn & Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones 1987 25 IPL Fries & Mehlhorn & Naher & Tsakalidis, A log log n Data Structure for Three-sided Range Queries 1987 3 COMPGEOM Alt & Mehlhorn & Wagener & Welzl, Congruence, Similarity, and Symmetries of Geometric Objects 1987 4 STACS Mehlhorn & Kaufmann, On Local Routing of Two-Terminal Nets 1987 72 INFCTRL Mehlhorn & Preparata, Area-Time Optimal Division for T = Omega((log n)^{1 + epsilon}) 1987 PAA Alt & Hagerup & Mehlhorn & Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones 1988 15 ICALP Mehlhorn & Yap, Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves 1988 17 SICOMP Mehlhorn & Naher & Alt, A Lower Bound on the Complexity of the Union-Split-Find Problem 1988 27 IPL Jung & Mehlhorn, Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees 1988 27 IPL Mehlhorn, A Faster Approximation Algorithm for the Steiner Problem in Graphs 1988 29 FOCS Dietzfelbinger & Karlin & Mehlhorn & Meyer auf der Heide & Rohnert & Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds 1988 318 LNCS Dietzfelbinger & Mehlhorn & Meyer auf der Heide & Rohnert, Upper and Lower Bounds for the Dictionary Problem 1988 3 GEOMETRY Alt & Mehlhorn & Wagener & Welzl, Congruence, Similarity, and Symmetries of Geometric Objects 1988 4 COMPGEOM Gao & Jerrum & Kaufmann & Mehlhorn & Rulling & Storb, On Continuous Homotopic One Layer Routing 1988 CGAPPS Gao & Kaufmann & Mehlhorn & Rulling & Storb & Jerrum, On Continuous Homotopic One Layer Routing (Extended Abstract) 1989 14 MFCS Mehlhorn & Naher, A Library of Efficient Data Types and Algorithms 1989 16 ICALP Mehlhorn & Paul, Two Versus One Index Register and Modifiable Versus Non-Modifiable Programs 1989 30 FOCS Mehlhorn & Naher & Rauch, On the Complexity of a Game Related to the Dictionary Problem 1989 38 IEEETC Furer & Mehlhorn, AT^2-Optimal Galois Field Multiplier for VLSI SHIFT TO GRAPH ALGORITHMS 1990 17 ICALP Cheriyan & Hagerup & Mehlhorn, Can a Maximum Flow be Computed in o(nm) Time? 1990 17 ICALP Naeher & Mehlhorn, LEDA: A Library of Efficient Data Types and Algorithms 1990 19 SICOMP Mehlhorn & Naher & Rauch, On the Complexity of a Game Related to the Dictionary Problem 1990 1 HTCS Mehlhorn & Tsakalidis, Data Structures 1990 1 ISAAC Klein & Mehlhorn & Meiser, On the Construction of Abstract Voronoi Diagrams, II 1990 35 IPL Ching & Mehlhorn & Smid, Dynamic Deferred Data Structuring 1990 35 IPL Mehlhorn & Haher, Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space 1990 35 IPL Mehlhorn & Naher & Uhrig, Hidden Line Elimination for Isooriented Rectangles 1990 37 JACM Ahuja & Mehlhorn & Orlin & Tarjan, Faster Algorithms for the Shortest Path Problem 1990 4 WDAG Fleischer & Jung & Mehlhorn, A Time-Randomness Tradeoff for Communication Complexity 1990 5 ALGRTHMICA Mehlhorn & Naher, Dynamic Fractional Cascading 1990 6 COMPGEOM Alt & Fleischer & Kaufmann & Mehlhorn & Naher & Schirra & Uhrig, Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures 1990 6 COMPGEOM Fleischer & Mehlhorn & Rote & Welzl & Yap, On Simultaneous Inner and Outer Approximation of Shapes 1990 7 STACS Mehlhorn & Meiser & O'Dunlaing, On the Construction of Abstract Voronoi Diagrams 1991 20 SICOMP Mehlhorn & Yap, Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves 1991 37 IPL Alt & Blum & Mehlhorn & Paul, Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n)) 1991 6 GEOMETRY Mehlhorn & Meiser & O'Dunlaing, On the Construction of Abstract Voronoi Diagrams 1991 LIBTR Alt & Guibas & Mehlhorn & Karp & Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities 1991 LIBTR Alt & Guibas & Mehlhorn & Karp & Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities 1991 LIBTR Dietzfelbinger & Karlin & Mehlhorn & Meyer auf der Heide & Rohnert & Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds 1992 101 INFCTRL Mehlhorn & Paul & Uhrig, k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs 1992 12 FSTTCS Mehlhorn, Recent Developments in Algorithms for the Maximum Flow Problem (Abstract) 1992 3 SODA Baumgarten & Jung & Mehlhorn, Dynamic Point Location in General Subdivisions 1992 3 SODA Mehlhorn & Sharir & Welzl, Tail Estimates for the Space Complexity of Randomized Incremental Algorithms 1992 42 IPL Alt & Geffert & Mehlhorn, A Lower Bound for the Nondeterministic Space Complexity of Context-free Recognition 1992 55 JCTB Kaufmann & Mehlhorn, On Local Routing of Two-Terminal Nets 1992 8 ALGRTHMICA Alt & Fleischer & Kaufmann & Mehlhorn & Naher & Schirra & Uhrig, Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures 1992 8 ALGRTHMICA Fleischer & Mehlhorn & Rote & Welzl & Yap, Simultaneous Inner and Outer Approximation of Shapes 1992 9 STACS Clarkson & Mehlhorn & Seidel, Four Results on Randomized Incremental Constructions 1992 DFGSJI Fleischer & Fries & Mehlhorn & Meiser & Naher & Rohnert & Schirra & Simon & Tsakalidis & Uhrig, Selected Topics from Computational Geometry, Data Structures and Motion Planning 1993 10 STACS Kucera & Mehlhorn & Preis & Schwarzenecker, Exact Algorithms for a Geometric Packing Problem 1993 13 FSTTCS Dubhashi & Mehlhorn & Ranjan & Thiel, Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets 1993 20 ICALP Hagerup & Mehlhorn & Munro, Maintaining Discrete Probability Distributions Optimally 1993 3 CGTA Clarkson & Mehlhorn & Seidel, Four Results on Randomized Incremental Constructions 1993 3 CGTA Klein & Mehlhorn & Meiser, Randomized Incremental Construction of Abstract Voronoi Diagrams 1993 3 CGTA Mehlhorn & Sharir & Welzl, Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection 1993 3 WADS Dobrindt & Mehlhorn & Yvinec, A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron 1993 40 JACM Mehlhorn & Tsakalidis, Dynamic Interpolation Search 1993 4 SODA Dietz & Mehlhorn & Raman & Uhrig, Lower Bounds for Set Intersection Queries 1994 13 IFIP Mehlhorn & Naher, The Implementation of Geometric Algorithms 1994 17 ALGORITHMS Baumgarten & Jung & Mehlhorn, Dynamic Point Location in General Subdivisions 1994 23 SICOMP Dietzfelbinger & Karlin & Mehlhorn & Meyer Auf Der Heide & Rohnert & Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds 1994 23 SICOMP Kaufmann & Mehlhorn, A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs 1994 2 ESA Burnikel & Mehlhorn & Schirra, How to Compute the Voronoi Diagram of Line Segments: Theoretical and Practical Results 1994 51 IPL Bilardi & Chaudhuri & Dubhashi & Mehlhorn, A Lower Bound for Area-Universal Graphs 1994 5 SODA Burnikel & Mehlhorn & Schirra, On Degeneracy in Geometric Computations 1994 5 SODA Mehlhorn & Sundar & Uhrig, Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time 1995 116 INFCTRL Fleischer & Jung & Mehlhorn, A Communication-Randomness Tradeoff for Two-Processor Systems 1995 14 ALGRTHMICA Dietz & Mehlhorn & Raman & Uhrig, Lower Bounds for Set Intersection Queries 1995 38 CACM Mehlhorn & Naher, LEDA: A Platform for Combinatorial and Geometric Computing 1995 3 ESA Mehlhorn & Priebe, On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka 1995 4 WADS Mehlhorn, Experiences with the Implementation of Geometric Algorithms 1996 12 COMPGEOM Mehlhorn & Naher & Schilz & Schirra & Seel & Seidel & Uhrig, Checking Geometric Programs or Verification of Geometric Structures 1996 15 ALGRTHMICA Cheriyan & Mehlhorn, Algorithms for Dense Graphs and Networks on the Random Access Computer 1996 16 ALGRTHMICA Alt & Guibas & Mehlhorn & Karp & Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities 1996 16 ALGRTHMICA Mehlhorn & Mutzel, On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm 1996 25 SICOMP Cheriyan & Hagerup & Mehlhorn, An o(n^3)-Time Maximum-Flow Algorithm 1997 10 RSA Mehlhorn & Priebe, On the All-Pairs Shortest-Path Algorithm of Moffat and Takaota 1997 13 COMPGEOM Mehlhorn & Muller & Naher & Schirra & Seel & Uhrig & Ziegler, A Computational Basis for Higher-dimensional Computational Geometry and Applications 1997 13 COMPGEOM Mehlhorn & Shermer & Yap, A Complete Roundness Classification Procedure 1997 17 ALGRTHMICA Mehlhorn & Sundar & Uhrig, Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time 1997 1 RANDOM Cooper & Frieze & Mehlhorn & Priebe, Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model 1997 24 ICALP Mehlhorn & Naher & Uhrig, The LEDA Platform for Combinatorial and Geometric Computing 1997 8 SODA Burnikel & Fleischer & Mehlhorn & Schirra, A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots 1997 8 SODA Finkler & Mehlhorn, Runtime Prediction of Real Programs on Real Machines 1998 10 CGTA Mehlhorn & Muller & Naher & Schirra & Seel & Uhrig & Ziegler, A Computational Basis for Higher-dimensional Computational Geometry and Applications 1998 14 COMPGEOM Crauser & Ferragina & Mehlhorn & Meyer & Ramos, Randomized External-Memory Algorithms for some Geometric Problems 1998 23 MFCS Crauser & Mehlhorn & Meyer & Sanders, A Parallelization of Dijkstra's Shortest Path Algorithm 1998 23 MFCS Mehlhorn & Naher, From Algorithms to Working Programs: On the Use of Program Checking in LEDA 1998 66 IPL Althaus & Mehlhorn, Maximum Network Flow with Floating Point Arithmetic 1999 10 ISAAC Mehlhorn, The Engineering of Some Bipartite Matching Programs 1999 10 SODA Finkler & Mehlhorn, Checking Priority Queues (short) 1999 12 CGTA Mehlhorn & Naher & Seel & Seidel & Schilz & Schirra & Uhrig, Checking Geometric Programs or Verification of Geometric Structures 1999 15 COMPGEOM Burnikel & Fleischer & Mehlhorn & Schirra, Efficient Exact Geometric Computation Made Easy 1999 15 COMPGEOM Dey & Mehlhorn & Ramos, Curve Reconstruction: Connecting Dots with Good Reason 1999 19 FSTTCS Mehlhorn, The Engineering of Some Bipartite Matching Programs 1999 3 WAE Crauser & Mehlhorn, LEDA-SM: Extending LEDA to Secondary Memory 1999 3 WAE Mehlhorn, Ten Years of LEDA: Some Thoughts (1 page) 1999 50 DIMACS Crauser & Ferragina & Mehlhorn & Meyer & Ramos, I/O-optimal Computation of Segment Intersections 1999 69 IPL Cheriyan & Mehlhorn, An Analysis of the Highest-level Selection Rule in the Preflow-Push Max-Flow Algorithm 1999 70 IPL Arikati & Mehlhorn, A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm 1999 8 CPC Arya & Golin & Mehlhorn, On the Expected Depth of Random Circuits 1999 CUP Mehlhorn & Naher, LEDA: A Platform for Combinatorial and Geometric Computing 2000 104 DAMATH Kececioglu & Lenhof & Mehlhorn & Mutzel & Reinert & Vingron, A Polyhedral Approach to Sequence Alignment Problems 2000 11 SODA Althaus & Mehlhorn, TSP-based Curve Reconstruction in Polynomial Time 2000 15 CGTA Dey & Mehlhorn & Ramos, Curve Reconstruction: Connecting Dots with Good Reason 2000 16 COMPGEOM Funke & Mehlhorn, LOOK -- A Lazy Object-Oriented Kernel for Geometric Computation 2000 16 RSA Cooper & Frieze & Mehlhorn & Priebe, Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model 2000 27 ALGRTHMICA Burnikel & Fleischer & Mehlhorn & Schirra, A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals 2000 27 ICALP Mehlhorn, Constraint Programming and Graph Algorithms 2000 31 SIGACTN Mehlhorn & Naher, contents of LEDA: A Platform for Combinatorial and Geometric Computing (Cambridge University Press, 1999) 2000 4 WAE Mehlhorn & Schafer, Implementation of O(nm log n) Weighted Matchings in General Graphs. The Power of Data Structures 2000 8 ESA Mehlhorn & Ziegelmann, Resource Constrained Shortest Paths 2001 12 SODA Althaus & Duchier & Koller & Mehlhorn & Niehren & Thiel, An Efficient Algorithm for the Configuration Problem of Dominance Graphs 2001 2000 LNCS Mehlhorn, From Algorithm to Program to Software Library 2001 3 ALENEX Mehlhorn & Ziegelmann, CNOP -- A Package for Constrained Network Optimization 2001 9 ESA Burnikel & Funke & Mehlhorn & Schirra & Schmitt, A Separation Bound for Real Algebraic Expressions 2001 9 ESA Mehlhorn & Schafer, A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms 2002 10 ESA Althaus & Bockmayr & Elf & Junger & Kasper & Mehlhorn, SCIL -- Symbolic Constraints in Integer Linear Programming 2002 10 ESA Berberich & Eigenwillig & Hemmer & Hert & Mehlhorn & Schomer, A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons 2002 10 ESA Mehlhorn & Meyer, External-Memory Breadth-First Search with Sublinear I/O 2002 22 CGTA Funke & Mehlhorn, LOOK: A Lazy Object-Oriented Kernel Design for Geometric Computation 2002 31 SICOMP Althaus & Mehlhorn, Traveling Salesman-Based Curve Reconstruction in Polynomial Time 2002 81 IPL Mehlhorn & Priebe & Schafer & Sivadasan, All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles 2003 11 ESA Granados & Hachenberger & Hert & Kettner & Mehlhorn & Seel, Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation 2003 14 SODA Dhiflaoui & Funke & Kwappik & Mehlhorn & Seel & Schomer & Schulte & Weber, Certifying and Repairing Solutions to Large LPs -- How Good are LP-solvers? (short) 2003 14 SODA Kratsch & McConnell & Mehlhorn & Spinrad, Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs 2003 2598 LNCS Mehlhorn, The Reliable Algorithmic Software Challenge RASC 2003 28 MFCS Banderier & Beier & Mehlhorn, Smoothed Analysis of Three Combinatorial Problems 2003 2 WEA Mehlhorn, The Reliable Algorithmic Software Challenge RASC 2003 35 ALGRTHMICA Mehlhorn & Sanders, Scanning Multiple Sequences via Cache Memory 2003 36 ALGRTHMICA Bast & Mehlhorn & Schafer & Tamaki, A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms 2003 48 ALGORITHMS Althaus & Duchier & Koller & Mehlhorn & Niehren & Thiel, An Efficient Graph Algorithm for Dominance Constraints 2003 86 IPL Kwek & Mehlhorn, Optimal Search for Rationals 2004 12 ESA Kettner & Mehlhorn & Pion & Schirra & Yap, Classroom Examples of Robustness Problems in Geometric Computations (Extended Abstract) 2004 15 ISAAC Abraham & Cechlarova & Manlove & Mehlhorn, Pareto Optimality in House Allocation Problems 2004 15 ISAAC Aronov & Asano & Katoh & Mehlhorn & Tokuyama, Polyline Fitting of Planar Points Under Min-sum Criteria 2004 15 SODA Althaus & Eisenbrand & Funke & Mehlhorn, Point Containment in the Integer Hull of a Polyhedron 2004 15 SODA Irving & Kavitha & Mehlhorn & Michail & Paluch, Rank-maximal Matchings 2004 21 STACS Bast & Mehlhorn & Schafer & Tamaki, Matching Algorithms Are Fast in Sparse Random Graphs 2004 21 STACS Kavitha & Mehlhorn & Michail & Paluch, Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem 2004 31 ICALP Kavitha & Mehlhorn & Michail & Paluch, A Faster Algorithm for Minimum Cycle Basis of Graphs 2005 13 ESA Berberich & Eigenwillig & Hemmer & Hert & Kettner & Mehlhorn & Reichel & Schmitt & Schomer & Wolpert, EXACUS: Efficient and Exact Algorithms for Curves and Surfaces 2005 16 SODA Abraham & Irving & Kavitha & Mehlhorn, Popular Matchings 2005 16 SODA Baswana & Kavitha & Mehlhorn & Pettie, New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners 2005 16 SODA Funke & Klein & Mehlhorn & Schmitt, Controlled Perturbation for Delaunay Triangulations 2005 22 STACS Kavitha & Mehlhorn, A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs 2005 31 CGTA Funke & Mehlhorn & Naher, Structural Filtering: A Paradigm for Efficient and Exact Geometric Programs 2005 32 ICALP Kaligosi & Mehlhorn & Munro & Sanders, Towards Optimal Multiple Selection 2005 4 WEA Mehlhorn & Michail, Implementing Minimum Cycle Basis Algorithms 2006 33 ICALP Hariharan & Kavitha & Mehlhorn, A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs 2006 33 ICALP Mehlhorn & Osbild & Sagraloff, Reliable and Efficient Computational Geometry Via Controlled Perturbation 2006 36 SICOMP Dratsch & McConnell & Mehlhorn & Spinrad, Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs 2006 39 MST Bast & Mehlhorn & Schafer & Tamaki, Matching Algorithms Are Fast in Sparse Random Graphs 2006 41 JSCOMP Krandick & Mehlhorn, New Bounds for the Descartes Method 2007 38 CGTA Hachenberger & Kettner & Mehlhorn, Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments 2007 40 MST Kavitha & Mehlhorn, Algorithms to Compute Minimum Cycle Basis in Directed Graphs