default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKurt Mehlhorn
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- award (2010): Paris Kanellakis Award
- award (1987): Gottfried Wilhelm Leibniz Prize
- award (1995): Konrad Zuse Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j168]Bhaskar Ray Chaudhury
, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. J. ACM 71(1): 4:1-4:27 (2024)- [j167]Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Satiation in Fisher Markets and Approximation of Nash Social Welfare. Math. Oper. Res. 49(2): 1109-1139 (2024) - [i58]Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi:
Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity. CoRR abs/2407.04474 (2024) - [i57]Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn:
Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments. CoRR abs/2409.14849 (2024) - [i56]Mahyar Afshinmehr, Mehrafarin Kazemi, Kurt Mehlhorn:
MMS Approximations Under Additive Leveled Valuations. CoRR abs/2410.02274 (2024) - [i55]Mahyar Afshinmehr, Alireza Danaei, Mehrafarin Kazemi, Kurt Mehlhorn, Nidhi Rathi:
EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture. CoRR abs/2410.17002 (2024) - [i54]Mahyar Afshinmehr, Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn:
Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms. CoRR abs/2410.18655 (2024) - 2023
- [c201]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI 2023: 2494-2502 - [c200]Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS 2023 - [c199]Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC 2023: 61 - [e14]Telikepalli Kavitha, Kurt Mehlhorn:
2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023. SIAM 2023, ISBN 978-1-61197-758-5 [contents] - [i53]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. CoRR abs/2305.04788 (2023) - [i52]Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR abs/2308.14545 (2023) - 2022
- [j166]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67(2): 439-461 (2022) - [j165]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
Fair Division of Indivisible Goods for a Class of Concave Valuations. J. Artif. Intell. Res. 74: 111-142 (2022) - [j164]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande:
Physarum-inspired multi-commodity flow dynamics. Theor. Comput. Sci. 920: 1-20 (2022) - [c198]Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland:
Maximizing Nash Social Welfare in 2-Value Instances. AAAI 2022: 4760-4767 - [i51]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX Allocations: Simplifications and Improvements. CoRR abs/2205.07638 (2022) - [i50]Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek:
Improving Order with Queues. CoRR abs/2207.02476 (2022) - [i49]Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland:
Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case. CoRR abs/2207.10949 (2022) - 2021
- [j163]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. 50(4): 1336-1358 (2021) - [c197]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. EC 2021: 310-311 - [i48]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. CoRR abs/2103.01628 (2021) - [i47]Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande:
Nash Social Welfare for 2-value Instances. CoRR abs/2106.14816 (2021) - 2020
- [j162]Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the non-uniform directed Physarum model. Theor. Comput. Sci. 816: 184-194 (2020) - [j161]Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the non-uniform Physarum dynamics. Theor. Comput. Sci. 816: 260-269 (2020) - [c196]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. EC 2020: 1-19 - [c195]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SODA 2020: 2658-2672 - [i46]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. CoRR abs/2002.05119 (2020) - [i45]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i44]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande:
Physarum Multi-Commodity Flow Dynamics. CoRR abs/2009.01498 (2020)
2010 – 2019
- 2019
- [b11]Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev:
Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox. Springer 2019, ISBN 978-3-030-25208-3, pp. 1-434 - [j160]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260: 28-50 (2019) - [j159]Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland:
Ratio-balanced maximum flows. Inf. Process. Lett. 150: 13-17 (2019) - [j158]Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Two results on slime mold computations. Theor. Comput. Sci. 773: 79-106 (2019) - [j157]Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Earning and Utility Limits in Fisher Markets. ACM Trans. Economics and Comput. 7(2): 10:1-10:35 (2019) - [c194]Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow:
Trustworthy Graph Algorithms (Invited Talk). MFCS 2019: 1:1-1:22 - [i43]Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the Non-Uniform Physarum Dynamics. CoRR abs/1901.07231 (2019) - [i42]Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland:
Ratio-Balanced Maximum Flows. CoRR abs/1902.11047 (2019) - [i41]Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the Non-Uniform Directed Physarum Model. CoRR abs/1906.07781 (2019) - [i40]Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow:
Trustworthy Graph Algorithms. CoRR abs/1907.04065 (2019) - [i39]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. CoRR abs/1907.04596 (2019) - 2018
- [j156]Cosmina Croitoru, Kurt Mehlhorn:
On testing substitutability. Inf. Process. Lett. 138: 19-21 (2018) - [j155]Przemyslaw Koprowski, Kurt Mehlhorn, Saurabh Ray:
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. J. Symb. Comput. 87: 238-241 (2018) - [c193]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division for Indivisible Items. FSTTCS 2018: 25:1-25:17 - [c192]Bhaskar Ray Chaudhury, Kurt Mehlhorn:
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. FSTTCS 2018: 26:1-26:16 - [c191]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-Finger Binary Search Trees. ISAAC 2018: 55:1-55:26 - [c190]Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Approximating the Nash Social Welfare with Budget-Additive Valuations. SODA 2018: 2326-2340 - [i38]Yun Kuen Cheung, Bhaskar Chaudhuri, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division of Indivisible Items. CoRR abs/1805.06232 (2018) - [i37]Cosmina Croitoru, Kurt Mehlhorn:
On testing substitutability. CoRR abs/1805.07642 (2018) - [i36]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-finger binary search trees. CoRR abs/1809.01759 (2018) - [i35]Bhaskar Ray Chaudhury, Kurt Mehlhorn:
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. CoRR abs/1810.01237 (2018) - [i34]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR abs/1812.08480 (2018) - 2017
- [j154]Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. Algorithmica 77(2): 309-335 (2017) - [c189]Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Earning Limits in Fisher Markets with Spending-Constraint Utilities. SAGT 2017: 67-79 - [i33]Kurt Mehlhorn, Stefan Näher, Peter Sanders:
Engineering DFS-Based Graph Algorithms. CoRR abs/1703.10023 (2017) - [i32]Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Approximating the Nash Social Welfare with Budget-Additive Valuations. CoRR abs/1707.04428 (2017) - [i31]Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Two Results on Slime Mold Computations. CoRR abs/1707.06631 (2017) - 2016
- [j153]Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. Algorithmica 74(3): 1184-1203 (2016) - [j152]Kurt Mehlhorn, Sanjeev Saxena:
A still simpler way of introducing interior-point method for linear programming. Comput. Sci. Rev. 22: 1-11 (2016) - [j151]Omar Darwish, Kurt Mehlhorn:
Improved balanced flow computation using parametric flow. Inf. Process. Lett. 116(9): 560-563 (2016) - [j150]Michael Sagraloff, Kurt Mehlhorn:
Computing real roots of real polynomials. J. Symb. Comput. 73: 46-86 (2016) - [j149]Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani:
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. Theory Comput. Syst. 59(4): 641-663 (2016) - [c188]Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Computing Equilibria in Markets with Budget-Additive Utilities. ESA 2016: 8:1-8:14 - [c187]Pavel Kolev, Kurt Mehlhorn:
A Note On Spectral Clustering. ESA 2016: 57:1-57:14 - [c186]Cosmina Croitoru, Kurt Mehlhorn:
Opposition Frameworks. JELIA 2016: 190-206 - [c185]Ran Duan, Jugal Garg, Kurt Mehlhorn:
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. SODA 2016: 90-106 - [i30]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
The landscape of bounds for binary search trees. CoRR abs/1603.04892 (2016) - [i29]Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Computing Equilibria in Markets with Budget-Additive Utilities. CoRR abs/1603.07210 (2016) - [i28]Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn:
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. CoRR abs/1612.04689 (2016) - 2015
- [j148]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica 73(2): 441-459 (2015) - [j147]Ran Duan, Kurt Mehlhorn:
A combinatorial polynomial algorithm for the linear Arrow-Debreu market. Inf. Comput. 243: 112-132 (2015) - [j146]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. J. Symb. Comput. 66: 34-69 (2015) - [c184]Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn, Girish Varma:
P. polycephalum Can Compute Shortest Paths. BICT 2015: 587 - [c183]Michael Dirnberger, Tim Kehl, Tim Mehlhorn, Kurt Mehlhorn, Adrian Neumann:
Towards an open online repository of P. polycephalum networks and their corresponding graph representations. BICT 2015: 588 - [c182]Kurt Mehlhorn:
On the Implementation of Combinatorial Algorithms for the Linear Exchange Market. Algorithms, Probability, Networks, and Games 2015: 87-94 - [c181]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA 2015: 300-312 - [c180]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423 - [c179]Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani:
Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design. SAGT 2015: 98-109 - [c178]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. WADS 2015: 152-165 - [i27]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
A Global Geometric View of Splaying. CoRR abs/1503.03105 (2015) - [i26]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. CoRR abs/1506.08319 (2015) - [i25]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-avoiding access in binary search trees. CoRR abs/1507.06953 (2015) - [i24]Pavel Kolev, Kurt Mehlhorn:
A Note On Spectral Clustering. CoRR abs/1509.09188 (2015) - [i23]Ran Duan, Jugal Garg, Kurt Mehlhorn:
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. CoRR abs/1510.02694 (2015) - [i22]Kurt Mehlhorn, Sanjeev Saxena:
A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. CoRR abs/1510.03339 (2015) - [i21]Omar Darwish, Kurt Mehlhorn:
Improved Balanced Flow Computation Using Parametric Flow. CoRR abs/1512.05974 (2015) - 2014
- [b10]Martin Dietzfelbinger, Kurt Mehlhorn, Peter Sanders:
Algorithmen und Datenstrukturen - die Grundwerkzeuge. eXamen.press, Springer 2014, ISBN 978-3-642-05471-6, pp. I-XII, 1-380 - [j145]Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Algorithmica 69(3): 619-640 (2014) - [j144]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah:
A Framework for the Verification of Certifying Computations. J. Autom. Reason. 52(3): 241-273 (2014) - [j143]Tomasz Jurkiewicz, Kurt Mehlhorn:
On a Model of Virtual Address Translation. ACM J. Exp. Algorithmics 19(1) (2014) - [c177]Lars Noschinski, Christine Rizkallah, Kurt Mehlhorn:
Verification of Certifying Computations through AutoCorres and Simpl. NASA Formal Methods 2014: 46-61 - [c176]Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. SWAT 2014: 50-61 - [c175]Kurt Mehlhorn:
Algorithms for Equilibrium Prices in Linear Market Models. WALCOM 2014: 1-4 - [i20]Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick K. Nicholson:
Cache-Oblivious VAT-Algorithms. CoRR abs/1404.3577 (2014) - [i19]Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani:
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. CoRR abs/1408.1577 (2014) - [i18]Nimrod Megiddo, Kurt Mehlhorn, Rahul Savani, Vijay V. Vazirani:
Equilibrium Computation (Dagstuhl Seminar 14342). Dagstuhl Reports 4(8): 73-88 (2014) - 2013
- [j142]Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt:
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72(1): 112-121 (2013) - [c174]Tomasz Jurkiewicz, Kurt Mehlhorn:
The cost of address translation. ALENEX 2013: 148-162 - [c173]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms 2013: 1-11 - [c172]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON 2013: 65-76 - [c171]Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. FSTTCS 2013: 339-350 - [c170]Ran Duan, Kurt Mehlhorn:
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. ICALP (1) 2013: 425-436 - [c169]Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn:
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. ICALP (2) 2013: 472-483 - [c168]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation. ISSAC 2013: 283-290 - [c167]Kurt Mehlhorn:
Physarum Computations (Invited talk). STACS 2013: 5-6 - [c166]Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. WG 2013: 358-369 - [i17]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition. CoRR abs/1301.4870 (2013) - [i16]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. CoRR abs/1301.5290 (2013) - [i15]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah:
A Framework for the Verification of Certifying Computations. CoRR abs/1301.7462 (2013) - [i14]Michael Sagraloff, Kurt Mehlhorn:
Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration. CoRR abs/1308.4088 (2013) - [i13]Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. CoRR abs/1309.4602 (2013) - [i12]Otfried Cheong, Kurt Mehlhorn, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 13101). Dagstuhl Reports 3(3): 1-23 (2013) - 2012
- [j141]Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt:
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica 62(3-4): 754-766 (2012) - [j140]Kurt Mehlhorn, Jörg-Rüdiger Sack:
CGTA-Awards 2011. Comput. Geom. 45(4): 139 (2012) - [j139]Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer:
Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. 463: 62-72 (2012) - [c165]Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun:
Counting Arbitrary Subgraphs in Data Streams. ICALP (2) 2012: 598-609 - [c164]Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma:
Physarum can compute shortest paths. SODA 2012: 233-240 - [e13]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer:
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Lecture Notes in Computer Science 7391, Springer 2012, ISBN 978-3-642-31593-0 [contents] - [e12]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer:
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Lecture Notes in Computer Science 7392, Springer 2012, ISBN 978-3-642-31584-8 [contents] - [i11]Karl Bringmann, Kurt Mehlhorn, Adrian Neumann:
Remarks on Category-Based Routing in Social Networks. CoRR abs/1202.2293 (2012) - [i10]George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. CoRR abs/1202.2877 (2012) - [i9]Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. CoRR abs/1211.6553 (2012) - [i8]Tomasz Jurkiewicz, Kurt Mehlhorn:
The Cost of Address Translation. CoRR abs/1212.0703 (2012) - [i7]Ran Duan, Kurt Mehlhorn:
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. CoRR abs/1212.0979 (2012) - [i6]Kurt Mehlhorn, Moshe Y. Vardi, Marc Herbstritt:
Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). Dagstuhl Reports 2(11): 20-44 (2012) - [i5]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn:
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j138]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica 59(4): 471-488 (2011) - [j137]Dan Halperin, Kurt Mehlhorn:
Guest Editorial: Selected Papers from European Symposium on Algorithms. Algorithmica 60(1): 1-2 (2011) - [j136]Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff:
A general approach to the analysis of controlled perturbation algorithms. Comput. Geom. 44(9): 507-528 (2011) - [j135]Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer:
Certifying algorithms. Comput. Sci. Rev. 5(2): 119-161 (2011) - [j134]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer:
An Introduction to Certifying Algorithms. it Inf. Technol. 53(6): 287-293 (2011) - [j133]Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt:
Weisfeiler-Lehman Graph Kernels. J. Mach. Learn. Res. 12: 2539-2561 (2011) - [j132]Kurt Mehlhorn, Michael Sagraloff:
A deterministic algorithm for isolating real roots of a real polynomial. J. Symb. Comput. 46(1): 70-90 (2011) - [c163]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah:
Verification of Certifying Computations. CAV 2011: 67-82 - [c162]George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. ESA 2011: 119-130 - [c161]Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun:
Approximate Counting of Cycles in Streams. ESA 2011: 677-688 - [c160]Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer:
Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) 2011: 478-489 - [c159]Kurt Mehlhorn:
The Physarum Computer. WALCOM 2011: 8 - [p5]Arno Eigenwillig, Kurt Mehlhorn:
Multiplication of Long Integers - Faster than Long Multiplication. Algorithms Unplugged 2011: 101-109 - [i4]Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma:
Physarum Can Compute Shortest Paths. CoRR abs/1106.0423 (2011) - [i3]Pankaj K. Agarwal, Kurt Mehlhorn, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 11111). Dagstuhl Reports 1(3): 19-41 (2011) - 2010
- [j131]Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre:
Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010) - [j130]Kurt Mehlhorn, Jörg-Rüdiger Sack:
Editorial. Comput. Geom. 43(6-7): 555 (2010) - [j129]Kurt Mehlhorn, Saurabh Ray:
Faster algorithms for computing Hong's bound on absolute positiveness. J. Symb. Comput. 45(6): 677-683 (2010) - [j128]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. 4(1): 45-66 (2010) - [j127]Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
Additive spanners and (alpha, beta)-spanners. ACM Trans. Algorithms 7(1): 5:1-5:26 (2010) - [c158]Kurt Mehlhorn, Pascal Schweitzer:
Progress on Certifying Algorithms. FAW 2010: 1-5 - [c157]Kurt Mehlhorn:
Reliable and Efficient Geometric Computing. ICMS 2010: 10-11
2000 – 2009
- 2009
- [j126]Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt:
A Separation Bound for Real Algebraic Expressions. Algorithmica 55(1): 14-28 (2009) - [j125]Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks:
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. 42(6-7): 722 (2009) - [j124]Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig:
Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4): 199-243 (2009) - [j123]Kurt Mehlhorn, Dimitrios Michail:
Minimum cycle bases: Faster and simpler. ACM Trans. Algorithms 6(1): 8:1-8:13 (2009) - [c156]Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi:
Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312 - [c155]Kurt Mehlhorn:
Assigning Papers to Referees. ICALP (1) 2009: 1-2 - [c154]Kurt Mehlhorn, Michael Sagraloff:
Isolating real roots of real polynomials. ISSAC 2009: 247-254 - [c153]Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, Karsten M. Borgwardt:
Efficient graphlet kernels for large graph comparison. AISTATS 2009: 488-495 - 2008
- [b9]Kurt Mehlhorn, Peter Sanders:
Algorithms and Data Structures: The Basic Toolbox. Springer 2008, ISBN 978-3-540-77977-3 - [j122]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica 52(3): 333-349 (2008) - [j121]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008) - [j120]Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn:
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008) - [p4]Arno Eigenwillig, Kurt Mehlhorn:
Multiplikation langer Zahlen (schneller als in der Schule). Taschenbuch der Algorithmen 2008: 109-118 - [e11]Dan Halperin, Kurt Mehlhorn:
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science 5193, Springer 2008, ISBN 978-3-540-87743-1 [contents] - 2007
- [j119]Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, Evangelia Pyrga:
Cycle bases of graphs and sampled manifolds. Comput. Aided Geom. Des. 24(8-9): 464-480 (2007) - [j118]Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn:
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput. Geom. 38(1-2): 64-99 (2007) - [j117]Telikepalli Kavitha, Kurt Mehlhorn:
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007) - [j116]David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn:
Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007) - [j115]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ACM Trans. Algorithms 3(2): 15 (2007) - [c152]Kurt Mehlhorn:
Matchings in Graphs Variations of the Problem. COCOA 2007: 1-2 - [c151]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656 - [c150]Kurt Mehlhorn:
Minimum Cycle Bases in Graphs Algorithms and Applications. MFCS 2007: 13-14 - [c149]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523 - 2006
- [j114]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. 16(2-3): 97-116 (2006) - [j113]Kurt Mehlhorn, Dimitrios Michail:
Implementing minimum cycle basis algorithms. ACM J. Exp. Algorithmics 11 (2006) - [j112]Werner Krandick, Kurt Mehlhorn:
New bounds for the Descartes method. J. Symb. Comput. 41(1): 49-66 (2006) - [j111]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006) - [j110]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006) - [j109]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. ACM Trans. Algorithms 2(4): 602-610 (2006) - [c148]Kurt Mehlhorn:
Reliable and Efficient Geometric Computing. CIAC 2006: 1-2 - [c147]Kurt Mehlhorn:
Reliable and Efficient Geometric Computing. ESA 2006: 2 - [c146]Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn:
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261 - [c145]Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff:
Reliable and Efficient Computational Geometry Via Controlled Perturbation. ICALP (1) 2006: 299-310 - [c144]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60 - [c143]Kurt Mehlhorn:
Reliable Geometric Computing. OR 2006: 111 - [i2]Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert:
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [j108]Werner Krandick, Kurt Mehlhorn:
New bounds for the Descartes method. SIGSAM Bull. 39(3): 94 (2005) - [j107]Stefan Funke, Kurt Mehlhorn, Stefan Näher:
Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31(3): 179-194 (2005) - [c142]Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert:
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC 2005: 138-149 - [c141]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert:
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166 - [c140]Kurt Mehlhorn:
Minimum Cycle Bases and Surface Reconstruction. GD 2005: 532-532 - [c139]Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders:
Towards Optimal Multiple Selection. ICALP 2005: 103-114 - [c138]David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn:
Pareto Optimality in House Allocation Problems. ISAAC 2005: 1163-1175 - [c137]David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn:
Popular matchings. SODA 2005: 424-432 - [c136]Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681 - [c135]Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt:
Controlled perturbation for Delaunay triangulations. SODA 2005: 1047-1056 - [c134]Telikepalli Kavitha, Kurt Mehlhorn:
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS 2005: 654-665 - [c133]Kurt Mehlhorn, Dimitrios Michail:
Implementing Minimum Cycle Basis Algorithms. WEA 2005: 32-43 - [e10]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - 2004
- [c132]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713 - [c131]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857 - [c130]David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn:
Pareto Optimality in House Allocation Problems. ISAAC 2004: 3-15 - [c129]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88 - [c128]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. SODA 2004: 68-75 - [c127]Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn:
Point containment in the integer hull of a polyhedron. SODA 2004: 929-933 - [c126]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - [c125]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS 2004: 222-233 - [i1]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004 - 2003
- [j106]Kurt Mehlhorn, Peter Sanders:
Scanning Multiple Sequences Via Cache Memory. Algorithmica 35(1): 75-93 (2003) - [j105]Hannah Bast, Kurt Mehlhorn, Guido Schäfer:
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36(1): 75-88 (2003) - [j104]Kurt Mehlhorn, Michael Seel:
Infimaximal Frames: A Technique for Making Lines Look Like Segments. Int. J. Comput. Geom. Appl. 13(3): 241-255 (2003) - [j103]Stephen Kwek, Kurt Mehlhorn:
Optimal search for rationals. Inf. Process. Lett. 86(1): 23-26 (2003) - [j102]Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient graph algorithm for dominance constraints. J. Algorithms 48(1): 194-219 (2003) - [c124]Kurt Mehlhorn:
The Reliable Algorithmic Software Challenge RASC. Computer Science in Perspective 2003: 255-263 - [c123]Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel:
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. ESA 2003: 654-666 - [c122]Cyril Banderier, René Beier, Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems. MFCS 2003: 198-207 - [c121]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167 - [c120]Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber:
Certifying and repairing solutions to large LPs how good are LP-solvers? SODA 2003: 255-256 - [c119]Kurt Mehlhorn:
The Reliable Algorithmic Software Challenge RASC. WEA 2003: 222 - 2002
- [j101]Stefan Funke, Kurt Mehlhorn:
LOOK: A Lazy Object-Oriented Kernel design for geometric computation. Comput. Geom. 22(1-3): 99-118 (2002) - [j100]Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan:
All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. 81(6): 341-343 (2002) - [j99]Kurt Mehlhorn, Guido Schäfer:
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. ACM J. Exp. Algorithmics 7: 4 (2002) - [c118]Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87 - [c117]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer:
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. ESA 2002: 174-186 - [c116]Kurt Mehlhorn, Ulrich Meyer:
External-Memory Breadth-First Search with Sublinear I/O. ESA 2002: 723-735 - 2001
- [j98]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geom. Appl. 11(3): 305-337 (2001) - [j97]Kurt Mehlhorn, Stefan Meiser, Ronald Rasch:
Furthest Site Abstract Voronoi Diagrams. Int. J. Comput. Geom. Appl. 11(6): 583-616 (2001) - [j96]Ernst Althaus, Kurt Mehlhorn:
Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. 31(1): 27-66 (2001) - [c115]Kurt Mehlhorn, Mark Ziegelmann:
CNOP - A Package for Constrained Network Optimization. ALENEX 2001: 17-31 - [c114]Kurt Mehlhorn:
From Algorithm to Program to Software Library. Informatics 2001: 268-273 - [c113]Kurt Mehlhorn, Guido Schäfer:
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA 2001: 242-253 - [c112]Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt:
A Separation Bound for Real Algebraic Expressions. ESA 2001: 254-265 - [c111]Kurt Mehlhorn:
Exact geometric computation. HERCMA 2001: 87 - [c110]Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient algorithm for the configuration problem of dominance graphs. SODA 2001: 815-824 - [p3]Kurt Mehlhorn, Stefan Schirra:
Exact Computation with leda_real - Theory and geometric Applications. Symbolic Algebraic Methods and Verification Methods 2001: 163-172 - 2000
- [j95]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27(1): 87-99 (2000) - [j94]Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos:
Curve reconstruction: Connecting dots with good reason. Comput. Geom. 15(4): 229-244 (2000) - [j93]Kurt Mehlhorn, Jörg-Rüdiger Sack:
Editorial. Comput. Geom. 17(1-2): 1-2 (2000) - [j92]John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron:
A polyhedral approach to sequence alignment problems. Discret. Appl. Math. 104(1-3): 143-186 (2000) - [j91]Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe:
Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000) - [c109]Alexander Koller, Kurt Mehlhorn, Joachim Niehren:
A Polynomial-Time Fragment of Dominance Constraints. ACL 2000: 376-383 - [c108]Stefan Funke, Kurt Mehlhorn:
Look - a Lazy Object-Oriented Kernel for geometric computation. SCG 2000: 156-165 - [c107]Kurt Mehlhorn, Sven Thiel:
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. CP 2000: 306-319 - [c106]Kurt Mehlhorn, Mark Ziegelmann:
Resource Constrained Shortest Paths. ESA 2000: 326-337 - [c105]Kurt Mehlhorn:
Constraint Programming and Graph Algorithms. ICALP 2000: 571-575 - [c104]Ernst Althaus, Kurt Mehlhorn:
TSP-based curve reconstruction in polynomial time. SODA 2000: 686-695 - [c103]Kurt Mehlhorn, Guido Schäfer:
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. WAE 2000: 23-38 - [e9]Kurt Mehlhorn, Gregor Snelting:
Informatik 2000, Neue Horizonte im neuen Jahrhundert 30. Jahrestagung der Gesellschaft für Informatik Berlin, 19.-22. September 2000. Informatik aktuell, Springer 2000, ISBN 978-3-540-67880-9 [contents]
1990 – 1999
- 1999
- [b8]Kurt Mehlhorn, Stefan Näher:
LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press 1999, ISBN 0-521-56329-1 - [j90]Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig:
Checking geometric programs or verification of geometric structures. Comput. Geom. 12(1-2): 85-103 (1999) - [j89]Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia:
Editorial. Comput. Geom. 12(3-4): 153-154 (1999) - [j88]Joseph Cheriyan, Kurt Mehlhorn:
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. Inf. Process. Lett. 69(5): 239-242 (1999) - [j87]Srinivasa Rao Arikati, Kurt Mehlhorn:
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70(5): 251-254 (1999) - [c102]Stefan Funke, Kurt Mehlhorn, Stefan Näher:
Structural filtering: A paradigm for efficient and exact geometric programs. CCCG 1999 - [c101]Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos:
Curve Reconstruction: Connecting Dots with Good Reason. SCG 1999: 197-206 - [c100]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
Efficient Exact Geometric Computation Made Easy. SCG 1999: 341-350 - [c99]Kurt Mehlhorn:
The Engineering of some Bipartite Matching Programs. FSTTCS 1999: 446-449 - [c98]Kurt Mehlhorn:
The Engineering of Some Bipartite Matching Programs. ISAAC 1999: 1-3 - [c97]Ulrich Finkler, Kurt Mehlhorn:
Checking Priority Queues. SODA 1999: 901-902 - [c96]Kurt Mehlhorn:
Ten Years of LEDA Some Thoughts (Abstract). WAE 1999: 14 - [c95]Andreas Crauser, Kurt Mehlhorn:
LEDA-SM Extending LEDA to Secondary Memory. WAE 1999: 229-243 - 1998
- [j86]Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler:
A computational basis for higher-dimensional computational geometry and applications. Comput. Geom. 10(4): 289-303 (1998) - [j85]Ernst Althaus, Kurt Mehlhorn:
Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. 66(3): 109-113 (1998) - [c94]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Some Geometric Problems. SCG 1998: 259-268 - [c93]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
I/O-optimal computation of segment intersections. External Memory Algorithms 1998: 131-138 - [c92]Kurt Mehlhorn, Stefan Näher:
From Algorithms to Working Programs on the Use of Program Checking in LEDA. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 81-88 - [c91]Kurt Mehlhorn, Stefan Näher:
From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS 1998: 84-93 - [c90]Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders:
A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731 - [e8]Kurt Mehlhorn:
Fundamentals - Foundations of Computer Science, IFIP World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary. books@ocg.at 117, Austrian Computer Society 1998, ISBN 3-85403-117-3 [contents] - [e7]Kurt Mehlhorn:
Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings. Max-Planck-Institut für Informatik 1998 [contents] - 1997
- [j84]Kurt Mehlhorn, R. Sundar, Christian Uhrig:
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997) - [j83]Kurt Mehlhorn, Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms 10(1-2): 205-220 (1997) - [c89]Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap:
A Complete Roundness Classification Procedure. SCG 1997: 129-138 - [c88]Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler:
A Computational Basis for Higher-Dimensional Computational Geometry and Applications. SCG 1997: 254-263 - [c87]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16 - [c86]Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe:
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM 1997: 15-26 - [c85]Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu:
A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250 - [c84]Ulrich Finkler, Kurt Mehlhorn:
Runtime Prediction of Real Programs on Real Machines. SODA 1997: 380-389 - [c83]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA 1997: 702-709 - [c82]Ulrike Bartuschka, Kurt Mehlhorn, Stefan Näher:
A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem. WAE 1997: 124-135 - 1996
- [j82]Joseph Cheriyan, Kurt Mehlhorn:
Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica 15(6): 521-549 (1996) - [j81]Kurt Mehlhorn, Petra Mutzel:
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica 16(2): 233-242 (1996) - [j80]Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson:
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5): 543-547 (1996) - [j79]Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn:
An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25(6): 1144-1170 (1996) - [c81]Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig:
Checking Geometric Programs or Verification of Geometric Structures. SCG 1996: 159-165 - [c80]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50 - [c79]Kurt Mehlhorn:
Position Paper for Panel Discussion. WACG 1996: 51-52 - 1995
- [j78]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995) - [j77]Kurt Mehlhorn, Stefan Näher:
LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM 38(1): 96-102 (1995) - [j76]Kurt Mehlhorn:
Guest Editor's Foreword. Discret. Comput. Geom. 14(4): 363 (1995) - [j75]Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Communication-Randomness Tradeoff for Two-Processor Systems. Inf. Comput. 116(2): 155-161 (1995) - [c78]Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Exact Geometric Computation in LEDA. SCG 1995: C18-C19 - [c77]Kurt Mehlhorn, Volker Priebe:
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. ESA 1995: 185-198 - [c76]Kurt Mehlhorn:
Experiences with the Implementation of Geometric Algorithms (Abstract). WADS 1995: 518 - 1994
- [j74]Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn:
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994) - [j73]Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn:
Dynamic Point Location in General Subdivisions. J. Algorithms 17(3): 342-380 (1994) - [j72]Michael Kaufmann, Kurt Mehlhorn:
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM J. Comput. 23(2): 227-246 (1994) - [j71]Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. 23(4): 738-761 (1994) - [c75]Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra:
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. ESA 1994: 227-239 - [c74]Kurt Mehlhorn, Stefan Näher:
The Implementation of Geometric Algorithms. IFIP Congress (1) 1994: 223-231 - [c73]Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra:
On Degeneracy in Geometric Computations. SODA 1994: 16-23 - [c72]Kurt Mehlhorn, R. Sundar, Christian Uhrig:
Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA 1994: 213-222 - [e6]Kurt Mehlhorn:
Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994. ACM 1994, ISBN 0-89791-648-4 [contents] - 1993
- [j70]Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams. Comput. Geom. 3: 157-184 (1993) - [j69]Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993) - [j68]Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. 3: 235-246 (1993) - [j67]Kurt Mehlhorn, Athanasios K. Tsakalidis:
Dynamic Interpolation Search. J. ACM 40(3): 621-634 (1993) - [c71]Kurt Mehlhorn, Volker Claus, Wolfgang Thomas:
Komplexitätstheorie und Algorithmik. Perspektiven der Informatik 1993: 113-116 - [c70]Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel:
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. FSTTCS 1993: 436-443 - [c69]Torben Hagerup, Kurt Mehlhorn, J. Ian Munro:
Maintaining Discrete Probability Distributions Optimally. ICALP 1993: 253-264 - [c68]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. SODA 1993: 194-201 - [c67]Ludek Kucera, Kurt Mehlhorn, B. Preis, Erik Schwarzenecker:
Exact Algorithms for a Geometric Packing Problem (Extended Abstract). STACS 1993: 317-322 - [c66]Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec:
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. WADS 1993: 314-324 - 1992
- [j66]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992) - [j65]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992) - [j64]Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig:
k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs. Inf. Comput. 101(1): 123-129 (1992) - [j63]Helmut Alt, Viliam Geffert, Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42(1): 25-27 (1992) - [j62]Michael Kaufmann, Kurt Mehlhorn:
On local routing of two-terminal nets. J. Comb. Theory B 55(1): 33-72 (1992) - [c65]Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig:
Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms 1992: 25-43 - [c64]Kurt Mehlhorn:
Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). FSTTCS 1992: 404 - [c63]Kurt Mehlhorn, Stefan Näher:
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) 1992: 493-505 - [c62]Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93 - [c61]Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn:
Dynamic Point Location in General Subdivisions. SODA 1992: 250-258 - [c60]Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. STACS 1992: 463-474 - [p2]Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams. Informatik 1992: 283-308 - 1991
- [j61]Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams. Discret. Comput. Geom. 6: 211-224 (1991) - [j60]Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul:
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. 37(4): 237-240 (1991) - [j59]Kurt Mehlhorn, Chee-Keng Yap:
Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20(4): 603-621 (1991) - 1990
- [j58]Kurt Mehlhorn, Stefan Näher:
Dynamic Fractional Cascading. Algorithmica 5(2): 215-241 (1990) - [j57]Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid:
Dynamic Deferred Data Structuring. Inf. Process. Lett. 35(1): 37-40 (1990) - [j56]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990) - [j55]Kurt Mehlhorn, Stefan Näher:
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Inf. Process. Lett. 35(4): 183-189 (1990) - [j54]Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan:
Faster Algorithms for the Shortest Path Problem. J. ACM 37(2): 213-223 (1990) - [j53]Kurt Mehlhorn, Stefan Näher, Monika Rauch:
On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19(5): 902-906 (1990) - [j52]Kurt Mehlhorn, Stefan Näher:
A faster compaction algorithm with automatic jog insertion. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(2): 158-166 (1990) - [j51]Kurt Mehlhorn, Wolfgang Rülling:
Compaction on the torus [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(4): 389-397 (1990) - [c59]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
On Simultaneous Inner and Outer Approximation of Shapes. SCG 1990: 216-224 - [c58]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG 1990: 281-289 - [c57]Stefan Näher, Kurt Mehlhorn:
LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) 1990: 35-39 - [c56]Stefan Näher, Kurt Mehlhorn:
LEDA: A Library of Efficient Data Types and Algorithms. ICALP 1990: 1-5 - [c55]Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn:
Can A Maximum Flow be Computed on o(nm) Time? ICALP 1990: 235-248 - [c54]Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms 1990: 138-154 - [c53]Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams. STACS 1990: 227-239 - [c52]Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Time-Randomness Tradeoff for Communication Complexity. WDAG 1990: 390-401 - [p1]Kurt Mehlhorn, Athanasios K. Tsakalidis:
Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 301-342
1980 – 1989
- 1989
- [b7]Jacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm:
Foundations of Programming Languages. John Wiley 1989, ISBN 0-471-92139-4 - [j50]Martin Fürer, Kurt Mehlhorn:
AT²-Optimal Galois Field Multiplier for VLSI. IEEE Trans. Computers 38(9): 1333-1336 (1989) - [c51]Kurt Mehlhorn, Stefan Näher, Monika Rauch:
On the Complexity of a Game Related to the Dictionary Problem. FOCS 1989: 546-548 - [c50]Kurt Mehlhorn, Wolfgang J. Paul:
Two Versus One Index Register and Modifiable Versus Non-modifiable Programs. ICALP 1989: 603-609 - [c49]Kurt Mehlhorn, Stefan Näher:
LEDA: A Library of Efficient Data Types and Algorithms. MFCS 1989: 88-106 - [e5]Kurt Mehlhorn:
Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989. ACM 1989, ISBN 0-89791-318-3 [contents] - 1988
- [j49]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. 3: 237-256 (1988) - [j48]Kurt Mehlhorn:
A Faster Approximation Algorithm for the Steiner Problem in Graphs. Inf. Process. Lett. 27(3): 125-128 (1988) - [j47]Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Inf. Process. Lett. 27(5): 227-236 (1988) - [j46]Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988) - [c48]Kurt Mehlhorn, Wolfgang Rülling:
Compaction on the Torus. AWOC 1988: 212-225 - [c47]Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum:
On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry 1988: 55-70 - [c46]Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling:
On Continuous Homotopic One Layer Routing. SCG 1988: 392-402 - [c45]Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531 - [c44]Kurt Mehlhorn, Gerhard Zimmermann:
SFB 124: VLSI-Entwurfsmethoden und Parallelität. GI Jahrestagung (2) 1988: 3-29 - [c43]Kurt Mehlhorn, Chee-Keng Yap:
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP 1988: 410-423 - [c42]Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert:
Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215 - 1987
- [j45]Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal Division for T=Omega((log n)^1+ epsilon). Inf. Comput. 72(3): 270-282 (1987) - [j44]Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis:
A log log n Data Structure for Three-Sided Range Queries. Inf. Process. Lett. 25(4): 269-273 (1987) - [j43]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987) - [c41]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. SCG 1987: 308-315 - [c40]Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488 - [c39]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15 - [c38]Michael Kaufmann, Kurt Mehlhorn:
On Local Routing of Two-Terminal Nets. STACS 1987: 40-52 - [e4]Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings. Lecture Notes in Computer Science 269, Springer 1987, ISBN 3-540-18099-0 [contents] - 1986
- [b6]Jacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm:
Grundlagen der Programmiersprachen. Teubner 1986, ISBN 3-519-02254-0 - [j42]Michael Becker, Kurt Mehlhorn:
Algorithms for Routing in Planar Graphs. Acta Informatica 23(2): 163-176 (1986) - [j41]Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh:
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1(2): 213-221 (1986) - [j40]Kurt Mehlhorn, Bernd H. Schmidt:
On BF-orderable graphs. Discret. Appl. Math. 15(2-3): 315-327 (1986) - [j39]Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan:
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees. Inf. Control. 68(1-3): 170-184 (1986) - [j38]Kurt Mehlhorn:
Über Verdrahtungsalgorithmen. Inform. Spektrum 9(4): 227-234 (1986) - [j37]Kurt Mehlhorn, Franco P. Preparata:
Routing through a rectangle. J. ACM 33(1): 60-85 (1986) - [j36]Michael Kaufmann, Kurt Mehlhorn:
Routing Through a Generalized Switchbox. J. Algorithms 7(4): 510-531 (1986) - [j35]Kurt Mehlhorn, Athanasios K. Tsakalidis:
An Amortized Analysis of Insertions into AVL-Trees. SIAM J. Comput. 15(1): 22-33 (1986) - [c37]Martin Fürer, Kurt Mehlhorn:
AT2-Optimal Galois Field Multiplier for VLSI. Aegean Workshop on Computing 1986: 217-225 - [c36]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208 - [c35]Kurt Mehlhorn, Franco P. Preparata:
Area-time Optimal Division for T=Omega(log n)1+epsilon. STACS 1986: 341-352 - [e3]Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, Paul G. Spirakis:
VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings. Lecture Notes in Computer Science 227, Springer 1986, ISBN 3-540-16766-8 [contents] - 1985
- [j34]Stefan Hertel, Kurt Mehlhorn:
Fast Triangulation of the Plane with Respect to Simple Polygons. Inf. Control. 64(1-3): 52-76 (1985) - [j33]Heikki Mannila, Kurt Mehlhorn:
A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 21(5): 269-272 (1985) - [j32]Helmut Alt, Kurt Mehlhorn:
Searching Semisorted Tables. SIAM J. Comput. 14(4): 840-848 (1985) - [c34]Otfried Fries, Kurt Mehlhorn, Stefan Näher:
Dynamization of geometric data structures. SCG 1985: 168-176 - [c33]Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan:
Sorting Jordan sequences in linear time. SCG 1985: 196-203 - [c32]Kurt Mehlhorn, Klaus Simon:
Intersecting two polyhedra one of which is convex. FCT 1985: 534-542 - [c31]Michael Kaufmann, Kurt Mehlhorn:
Routing Through a Generalized Switchbox. ICALP 1985: 328-337 - [c30]Kurt Mehlhorn, Athanasios K. Tsakalidis:
Dynamic Interpolation Search. ICALP 1985: 424-434 - [e2]Kurt Mehlhorn:
STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings. Lecture Notes in Computer Science 182, Springer 1985, ISBN 3-540-13912-5 [contents] - 1984
- [b5]Kurt Mehlhorn:
Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science 1, Springer 1984, ISBN 3-540-13302-X, pp. I-XIV, 1-336 - [b4]Kurt Mehlhorn:
Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science 2, Springer 1984, ISBN 3-540-13641-X, pp. I-XII, 1-262 - [b3]Kurt Mehlhorn:
Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. EATCS Monographs on Theoretical Computer Science 3, Springer 1984, ISBN 3-540-13642-8, pp. I-XII, 1-284 - [j31]Kurt Mehlhorn, Uzi Vishkin:
Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica 21: 339-374 (1984) - [j30]Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt:
Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica 21: 501-519 (1984) - [j29]Kurt Mehlhorn:
AT2-optimal VLSI integer division and integer square rooting. Integr. 2(2): 163-167 (1984) - [j28]Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984) - [c29]Kurt Mehlhorn:
On Optimal VLSI-Circuits for the Basic Arithmetic Functions. CAAP 1984: 23-30 - [c28]Kurt Mehlhorn:
Über Verdrahtungsalgorithmen. GI Jahrestagung (Fachgespräche) 1984: 79-89 - [c27]Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. ICALP 1984: 347-357 - [e1]Max Fontet, Kurt Mehlhorn:
STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings. Lecture Notes in Computer Science 166, Springer 1984, ISBN 3-540-12920-0 [contents] - 1983
- [j27]Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek:
The Recognition of Deterministic CFL's in Small Time and Space. Inf. Control. 56(1/2): 34-51 (1983) - [j26]Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. Inf. Control. 58(1-3): 137-156 (1983) - [j25]Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg:
Cost Trade-offs in Graph Embeddings, with Applications. J. ACM 30(4): 709-728 (1983) - [c26]Stefan Hertel, Kurt Mehlhorn:
Fast Triangulation of Simple Polygons. FCT 1983: 207-218 - [c25]Kurt Mehlhorn, Bernd H. Schmidt:
A Single Shortest Path Algorithm for Graphs with Separators. FCT 1983: 302-309 - [c24]Kurt Mehlhorn, Uzi Vishkin:
Granularity of Memory in Parallel Computation. WG 1983: 231-240 - 1982
- [j24]Scott Huddleston, Kurt Mehlhorn:
A New Data Structure for Representing Sorted Lists. Acta Informatica 17: 157-184 (1982) - [j23]Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood:
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees. Inf. Control. 55(1-3): 125-174 (1982) - [j22]Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter:
A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. 15(3): 135-136 (1982) - [j21]Kurt Mehlhorn:
A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. SIAM J. Comput. 11(4): 748-760 (1982) - [c23]Kurt Mehlhorn:
On the Program Size of Perfect and Universal Hash Functions. FOCS 1982: 170-175 - [c22]Kurt Mehlhorn, Erik Meineche Schmidt:
Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract). STOC 1982: 330-337 - 1981
- [j20]Kurt Mehlhorn, Mark H. Overmars:
Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 12(2): 93-98 (1981) - [j19]Kurt Mehlhorn:
Arbitrary Weight Changes in Dynamic Trees. RAIRO Theor. Informatics Appl. 15(3): 183-211 (1981) - [j18]Kurt Mehlhorn:
Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures. Math. Syst. Theory 15(1): 1-16 (1981) - [c21]Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg:
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981: 41-55 - [c20]Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161 - [c19]Scott Huddleston, Kurt Mehlhorn:
Robust Balancing in B-Trees. Theoretical Computer Science 1981: 234-244 - [c18]Kurt Mehlhorn:
Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. WG 1981: 265-278 - 1980
- [j17]Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider:
Binary Search Trees: Average and Worst Case Behavior. J. Inf. Process. Cybern. 16(1-3): 41-61 (1980) - [j16]Doris Altenkamp, Kurt Mehlhorn:
Codes: Unequal Probabilities, Unequal Letter Cost. J. ACM 27(3): 412-427 (1980) - [j15]Norbert Blum, Kurt Mehlhorn:
On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11: 303-320 (1980) - [j14]Kurt Mehlhorn:
An efficient algorithm for constructing nearly optimal prefix codes. IEEE Trans. Inf. Theory 26(5): 513-517 (1980) - [c17]Kurt Mehlhorn:
Pebbling Moutain Ranges and its Application of DCFL-Recognition. ICALP 1980: 422-435 - [c16]Kurt Mehlhorn:
A New Data Structure for Representing Sorted Lists. WG 1980: 90-112
1970 – 1979
- 1979
- [j13]Kurt Mehlhorn:
Some Remarks on Boolean Sums. Acta Informatica 12: 371-375 (1979) - [j12]Kurt Mehlhorn:
Parsing Macro Grammars Top Down. Inf. Control. 40(2): 123-143 (1979) - [j11]Helmut Alt, Kurt Mehlhorn:
Complexity arguments in algebraic language theory. RAIRO Theor. Informatics Appl. 13(3): 217-225 (1979) - [j10]Kurt Mehlhorn:
Dynamic Binary Search. SIAM J. Comput. 8(2): 175-198 (1979) - [c15]Kurt Mehlhorn:
Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. GI Jahrestagung 1979: 16-22 - [c14]Kurt Mehlhorn:
Searching, Sorting and Information Theory. MFCS 1979: 131-145 - [c13]Kurt Mehlhorn:
Some Remarks on Boolean Sums. MFCS 1979: 375-380 - [c12]Norbert Blum, Kurt Mehlhorn:
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science 1979: 67-78 - [c11]Kurt Mehlhorn:
Sorting Presorted Files. Theoretical Computer Science 1979: 199-212 - 1978
- [j9]Kurt Mehlhorn:
Effiziente Algorithmen: Ein Beispiel. Inform. Spektrum 1(2): 81-89 (1978) - [c10]Doris Altenkamp, Kurt Mehlhorn:
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). ICALP 1978: 15-25 - 1977
- [b2]Kurt Mehlhorn:
Effiziente Algorithmen. Teubner 1977, ISBN 3-519-02343-1 - [j8]Peter Deussen, Kurt Mehlhorn:
Van Wijngaarden Grammars and Space Complexity Classs EXSPACE. Acta Informatica 8: 193-199 (1977) - [j7]Kurt Mehlhorn:
A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM J. Comput. 6(2): 235-239 (1977) - [c9]Kurt Mehlhorn:
Dynamic Binary Search. ICALP 1977: 323-336 - 1976
- [j6]Kurt Mehlhorn, Zvi Galil:
Monotone switching circuits and boolean matrix product. Computing 16(1-2): 99-111 (1976) - [j5]Kurt Mehlhorn:
An Improved Lower Bound on the Formula Complexity of Context-free Recognition. J. Inf. Process. Cybern. 12(11/12): 523-524 (1976) - [j4]Kurt Mehlhorn:
Bracket-Languages are Recognizable in Logarithmic Space. Inf. Process. Lett. 5(6): 168-170 (1976) - [j3]Kurt Mehlhorn:
Polynomial and Abstract Subrecursive Classes. J. Comput. Syst. Sci. 12(2): 147-178 (1976) - [c8]Manfred Heydthausen, Kurt Mehlhorn:
Top Down Parsing of Macro Grammars. GI Jahrestagung 1976: 95-108 - [c7]Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider, Norbert Wernet:
Binary Search Trees: Average and Worst Case Behavior. GI Jahrestagung 1976: 301-313 - [c6]Helmut Alt, Kurt Mehlhorn:
Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP 1976: 338-354 - 1975
- [j2]Kurt Mehlhorn:
Nearly Optimal Binary Search Trees. Acta Informatica 5: 287-295 (1975) - [j1]Helmut Alt, Kurt Mehlhorn:
A language over a one symbol alphabet requiring only O (log log n) space. SIGACT News 7(4): 31-33 (1975) - [c5]Kurt Mehlhorn:
Best possible bounds for the weighted path length of optimum binary search trees. Automata Theory and Formal Languages 1975: 31-41 - [c4]Kurt Mehlhorn, Zvi Galil:
Monotone Switching Circuits and Boolean Matrix Product. MFCS 1975: 315-319 - 1974
- [b1]Kurt Mehlhorn:
Polynomial and Abstract Subrecursive Classes. Cornell University, USA, 1974 - [c3]Kurt Mehlhorn:
The "Almost All" Theory of Subrecursive Degrees is Decidable. ICALP 1974: 317-325 - [c2]Kurt Mehlhorn:
Polynomial and Abstract Subrecursive Classes. STOC 1974: 96-109 - 1973
- [c1]Kurt Mehlhorn:
On the Size of Sets of Computable Functions. SWAT 1973: 190-196
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
