Searching for authors named "Kurt Mehlhorn" – sorted by Relevance.
-
Verified Result Checkers
- Diplomarbeit Veried Result Checkers Kurt Mehlhorn October 18, 2000 The programs in LEDA have
- Add To MetaCart
-
The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
- on the occasion of his 60th birthday Kurt Mehlhorn September 8, 2002 When I was asked to contribute to a volume
- Cited by 2 (0 self) – Add To MetaCart
-
a Library of Efficient Data Types and Algorithms
- A Library LEDA of Efficient Data Types and Algorithms Kurt Mehlhorn and Stefan N£her Fachbereich
- Cited by 38 (6 self) – Add To MetaCart
-
Resource constrained shortest paths
- Resource Constrained Shortest Paths� Kurt Mehlhorn1 and Mark Ziegelmann1�� �ØØÔ
- Cited by 19 (1 self) – Add To MetaCart
-
Compaction on the
- - paction. Compaction on the Torus KURT MEHLHORN AND WOLFGANG RULLING I. INTRODUCTION COMPACTER takes
- Add To MetaCart
-
Komplexitätstheorie: WS 98/99
- Komplexitatstheorie: WS 98/99 Kurt Mehlhorn and Laurant Porkolap 21st October 1998 1
- Add To MetaCart
-
Implementation of O(nm log n) Weighted Matchings in General Graphs - The Power of Data Structures
- Kurt Mehlhorn and Guido Schafer Max{Planck{Institut fur Informatik, Stuhlsatzenhausweg 85, 66123
- Cited by 2 (0 self) – Add To MetaCart
-
Traveling salesman-based curve reconstruction in polynomial time
- –66 TRAVELING SALESMAN-BASED CURVE RECONSTRUCTION IN POLYNOMIAL TIME ∗ ERNST ALTHAUS † AND KURT MEHLHORN
- Cited by 5 (1 self) – Add To MetaCart
-
Scanning Multiple Sequences Via Cache Memory
- Scanning Multiple Sequences Via Cache Memory Kurt Mehlhorn Peter Sanders Max-Planck-Institut fur
- Cited by 4 (0 self) – Add To MetaCart
-
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
- A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs Telikepalli Kavitha ⋆ Kurt
- Cited by 6 (3 self) – Add To MetaCart

