- An Analysis of the Highest-Level Selection Rule in the Pre ow-Push Max-Flow Algorithm
- Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
- The Reliable Algorithmic Software Challenge dedicated to Thomas Ottmann on the occasion of his 60th birthday
- ROBUST BALANCING IN B-TREES Extended Abstract
- Implementation of O(nm log n) Weighted Matchings in General Graphs
- From Algorithm to Program to Software Kurt Mehlhorn
- Dynamic Interpolation Search KURT MEHLHORN
- The Implementation of Geometric Algorithms Kurt Mehlhorn Stefan Naher
- A Separation Bound for Real Algebraic Expressions # Christoph Burnikel + Stefan Funke # Kurt Mehlhorn # Stefan Schirra
- An O(n + m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
- Optimal Algorithms for Generating Discrete Random Variables with Changing Distributions
- AN EFFICIENT GRAPH ALGORITHM FOR DOMINANCE CONSTRAINTS
- Boolean Operations on 3D Selective Nef Complexes Data Structure, Algorithms, and Implementation
- Progress on Certifying Algorithms Kurt Mehlhorn and Pascal Schweitzer
- Smoothed Analysis of Three Combinatorial Cyril Banderier 1 , Rene Beier 2 , and Kurt Mehlhorn 2
- A Correctness Certi cate for the Stoer-Wagner Min-Cut Srinivasa R. Arikati Kurt Mehlhorn y
- Implementing Minimum Cycle Basis algorithms Kurt Mehlhorn and Dimitrios Michail
- TSP-BASED CURVE RECONSTRUCTION IN POLYNOMIAL TIME ERNST ALTHAUS y AND KURT MEHLHORN z
- Computational Theory and Applications
- A Faster Deterministic Algorithm for Minimum Cycle Basis in Directed Graphs
- On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka*
- Controlled Perturbation for Delaunay Triangulations Stefan Funke
- RankMaximal Matchings Robert W. Irving Telikepalli Kavitha + Kurt Mehlhorn +
- Geometric Computing with CGAL and LEDA Kurt Mehlhorn and Stefan Schirra
- Reliable and Efficient Computational Geometry via Controlled Perturbation
- Pareto optimality in house allocation problems David J. Abraham 1? , Katar na Cechl arov a 2 , David F. Manlove 3?? and
- Dynamic Perfect Hashing: Upper and Lower Bounds
- A faster algorithm for Minimum Cycle Basis of graphs (Submitted to Track A)
- Towards Optimal Multiple Selection Kanela Kaligosi 1 , Kurt Mehlhorn 1 , J. Ian Munro 2 , and Peter Sanders 3
- CNOP A Package for Constrained Network Optimization
- Network Problems with NonPolynomial Weights and Applications
- INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE de r eche r che
- Exact Geometric Computation in LEDA C. Burnikel \Lambda J. Konemann y K. Mehlhorn \Lambda S. Naher z S. Schirra \Lambda C. Uhrig \Lambda
- Point Containment in the Integer Hull of a Polyhedron Ernst Althaus y Friedrich Eisenbrand y Stefan Funke y Kurt Mehlhorn y
- From Algorithms to Working Programs On the Use of Program Checking in LEDA
- Computational Geometry 31 (2005) 179194 www.elsevier.com/locate/comgeo
- PI Informatik 1 Kurt Mehlhorn Constraint Programming and Graph Algorithms
- Certifying Algorithms R. M. McConnella, K. Mehlhornb,, S. Naherc, P. Schweitzerd
- Randomized ExternalMemory Algorithms for Some Geometric Problems
- A Complete Roundness Classification Procedure Kurt Mehlhorn 1 Thomas C. Shermer 2 Chee K. Yap 3
- A Library of Efficient Data Types and Algorithms * Stefan Niiher and Kurt Mehlhorn
- Online Graph Exploration: New Results on Old and New Algorithms
- Certifying and Repairing Solutions to Large LPs How Good are LPsolvers?
- A Polynomial-Time Fragment of Dominance Constraints Alexander Koller Kurt Mehlhorn Joachim Niehren
- SCIL --Symbolic Constraints in Integer Linear Programming \Lambda Ernst Althaus
- On Continuous Homotopic One Layer Routing
- Checking Priority Queues Ulrich Finkler"
- On Degeneracy Christoph Burnikelt
- Arrangements on Parametric Surfaces I: General Framework and Infrastructure
- Las Vegas is better than Determinism in VLSI and Distributed Computing
- Checking Geometric Programs or Verification of Geometric Structures 1 Kurt Mehlhorn 2 Stefan Naher 3 Michael Seel 2 Raimund Seidel 4
- Ecient Exact Geometric Computation Made Easy C. Burnikel R. Fleischer K. Mehlhorn S. Schirra
- A Strong and Easily Computable Separation Bound for
- Algorithmica (1997) 17:183-198 Algorithmica~) 1997Springer-Verlag New York Inc.
- A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
- A Computational Basis for Conic Arcs Boolean Operations on Conic Polygons
- Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n 1:5 q
- Scanning Multiple Sequences Via Cache Memory \Lambda Kurt Mehlhorn Peter Sanders
- Algorithms to Compute Minimum Cycle Basis in Directed Graphs #
- Faster Algorithms for Computing Hong's Bound on Absolute Positiveness
- Cycle Bases of Graphs and Sampled Craig Gotsman a
- A Deterministic Descartes Algorithm for Real Polynomials
- Infimaximal Frames A Technique for Making Lines Look Like Segments
- NEW BOUNDS FOR THE DESCARTES METHOD WERNER KRANDICK AND KURT MEHLHORN
- Can a Maximum Flow be Computed in o(nm)Time? JOSEPH CHERIYAN, TORBEN HAGERUP~AND KURT MEHLHORN
- New Approximation Algorithms for Minimum Cycle Bases of Telikepalli Kavitha Kurt Mehlhorn Dimitrios Michail
- Journal of Machine Learning Research 1 (2010) 1-48 Submitted 4/00; Published 10/00 Weisfeiler-Lehman graph kernels
- On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
- Amortisierte Analyse Kurt Mehlhorn
- A Heuristic for Dijkstra's Algorithm with Many Targets and its Use in Weighted
- The LEDA class real number \Lambda Christoph Burnikel Kurt Mehlhorn Stefan Schirra
- Verification of Certifying Computations Eyad Alkassar1
- Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge
- Breaking the O(m2 n) Barrier for Minimum Cycle
- Cycle Bases in Graphs Characterization, Algorithms, Complexity, and Applications
- Efficient graphlet kernels for large graph comparison Nino Shervashidze
- Minimum Cycle Bases: Faster and Simpler Kurt Mehlhorn Dimitrios Michail
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics
- Polyline Fitting of Planar Points under Min-Sum Criteria Boris Aronov
- Computational Geometry 22 (2002) 99118 www.elsevier.com/locate/comgeo
- Exact Computation with leda real Theory and Geometric Applications
- The LEDA Platform Combinatorial and Geometric Computing
- On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka*
- Exact Algorithms for a Geometric Packing (Extended Abstract)
- Algorithmica (1995) 14:154-168 Algorithmica9 1995Springer-Verlag New York lnc,
- of Efficient Data Types and Algorithms Kurt Mehlhorn and Stefan Nher
- Dynamiration of Geometric Data Structures 0. Fries, K. Mehlhorn, St. Niiher
- Acta Informatica 17, 157-184(1982) 9 Springer-Verlag1982
- A General Approach Analysis of Controlled Perturbation Algorithms
- A Platform for Combinatorial and Geometric Computing \Lambda Kurt Mehlhorn
- Algorithms for Dense Graphs and Networks J. Cheriyan
- International Journal of Computational Geometry & Applications World Scienti c Publishing Company
- Resource Constrained Shortest Paths ? Kurt Mehlhorn 1 and Mark Ziegelmann 1??
- Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
- A Remark on the Sign Variation Method for Real Root Isolation Kurt Mehlhorn y
- Matching Algorithms are Fast in Sparse Random Graphs Holger Bast + Kurt Mehlhorn + Guido Schafer + Hisao Tamaki ##
- Extending LEDA to Secondary Memory Andreas Crauser and Kurt Mehlhorn
- A Lower Bound for the Nondeterministic Space Complexity of Context-free Recognition
- [Sei90] R. Seidel. Linear programming and convex hulls made easy. Proc. 6th Ann. ACM Symp. Computational Geometry, pages 211--215,
- Constraint Programming and Graph Algorithms Kurt Mehlhorn
- Maximum Network Flow with Floating Point Arithmetic Ernst Althaus Kurt Mehlhorn y
- A Polyhedral Approach to Sequence Alignment Problems
- Experiments on Curve Reconstruction Ernst Althaus
- Popular Matchings David J. Abraham Robert W. Irving y Telikepalli Kavitha z Kurt Mehlhorn z
- Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
- Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
- Optimal Search for Rationals Stephen Kwek Kurt Mehlhorn y
- Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized
- Multiplication of Long Integers (Faster than Long Multiplication)
- New Constructions of (a;b)Spanners and Purely Additive Spanners
- Runtime Prediction of Real Programs on Real Machines* Kurt Mehlhorn*
- Improved minimum cycle bases algorithms by restriction to isometric cycles
- Approximate Counting of Cycles in Streams Madhusudan Manjunath1
