Kurt Mehlhorn - RankMe

468 papers A* 56A 38B 35C 2Misc 3Journal 233Unranked 74

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm. J. Autom. Reason. Mohammad Abdulaziz, Kurt Mehlhorn
2026	J	`jnl`	Achieving EF1 and Epistemic EFX Guarantees Simultaneously. CoRR Hannaneh Akrami, Ryoga Mahara, Kurt Mehlhorn, Nidhi Rathi
2026	J	`jnl`	Gabow's O(√nm) Maximum Cardinality Matching Algorithm, Revisited. CoRR Kurt Mehlhorn, Romina Nobahari
2026	J	`jnl`	Improving order with queues. J. Comb. Optim. Andreas Karrenbauer, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek, Alireza Haqi, Siavash Rahimi Shateranloo
2025	J	`jnl`	EFX Allocations Exist on Triangle-Free Multi-Graphs. CoRR Mahyar Afshinmehr, Arash Ashuri, Pouria Mahmoudkhan, Kurt Mehlhorn
2025	A	`conf`	EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture. AAMAS Mahyar Afshinmehr, Alireza Danaei, Mehrafarin Kazemi, Kurt Mehlhorn, Nidhi Rathi
2025	J	`jnl`	EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. Oper. Res. Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2025	J	`jnl`	Optimizing Car Resequencing on Mixed-Model Assembly Lines: Algorithm Development and Deployment. CoRR Andreas Karrenbauer, Bernd Kuhn, Kurt Mehlhorn, Paolo Luigi Rinaldi
2025	A*	`conf`	Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity. AAAI Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi
2024	J	`jnl`	Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms. CoRR Mahyar Afshinmehr, Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn
2024	J	`jnl`	EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture. CoRR Mahyar Afshinmehr, Alireza Danaei, Mehrafarin Kazemi, Kurt Mehlhorn, Nidhi Rathi
2024	J	`jnl`	EFX Exists for Three Agents. J. ACM Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
2024	J	`jnl`	Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments. CoRR Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn
2024	J	`jnl`	Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number. Math. Oper. Res. Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
2024	J	`jnl`	MMS Approximations Under Additive Leveled Valuations. CoRR Mahyar Afshinmehr, Mehrafarin Kazemi, Kurt Mehlhorn
2024	J	`jnl`	Maximizing Nash Social Welfare in 2-Value Instances: A Simpler Proof for the Half-Integer Case. CoRR Kurt Mehlhorn
2024	J	`jnl`	Satiation in Fisher Markets and Approximation of Nash Social Welfare. Math. Oper. Res. Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2024	J	`jnl`	Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity. CoRR Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi
2023	—	`ed.`	2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023 SOSA Telikepalli Kavitha, Kurt Mehlhorn
2023	A*	`conf`	EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2023	A*	`conf`	Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2023	J	`jnl`	Fair and Efficient Allocation of Indivisible Chores with Surplus. CoRR Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2023	A*	`conf`	Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami
2023	J	`jnl`	Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami
2022	J	`jnl`	EFX Allocations: Simplifications and Improvements. CoRR Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2022	J	`jnl`	Fair Division of Indivisible Goods for a Class of Concave Valuations. J. Artif. Intell. Res. Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn
2022	J	`jnl`	Improving Order with Queues. CoRR Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek
2022	A*	`conf`	Maximizing Nash Social Welfare in 2-Value Instances. AAAI Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland
2022	J	`jnl`	Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case. CoRR Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland
2022	J	`jnl`	Physarum-inspired multi-commodity flow dynamics. Theor. Comput. Sci. Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande
2022	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2021	J	`jnl`	A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2021	A*	`conf`	Improving EFX Guarantees through Rainbow Cycle Number. EC Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
2021	J	`jnl`	Improving EFX Guarantees through Rainbow Cycle Number. CoRR Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
2021	J	`jnl`	Nash Social Welfare for 2-value Instances. CoRR Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande
2020	A*	`conf`	A Little Charity Guarantees Almost Envy-Freeness. SODA Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2020	J	`jnl`	Convergence of the non-uniform Physarum dynamics. Theor. Comput. Sci. Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
2020	J	`jnl`	Convergence of the non-uniform directed Physarum model. Theor. Comput. Sci. Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
2020	A*	`conf`	EFX Exists for Three Agents. EC Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
2020	J	`jnl`	EFX Exists for Three Agents. CoRR Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
2020	J	`jnl`	Physarum Multi-Commodity Flow Dynamics. CoRR Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande
2020	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. CoRR Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2019	J	`jnl`	A Little Charity Guarantees Almost Envy-Freeness. CoRR Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2019	J	`jnl`	Convergence of the Non-Uniform Directed Physarum Model. CoRR Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
2019	J	`jnl`	Convergence of the Non-Uniform Physarum Dynamics. CoRR Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
2019	J	`jnl`	Earning and Utility Limits in Fisher Markets. ACM Trans. Economics and Comput. Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2019	J	`jnl`	Ratio-Balanced Maximum Flows. CoRR Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland
2019	J	`jnl`	Ratio-balanced maximum flows. Inf. Process. Lett. Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland
2019	—	`book`	Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev
2019	J	`jnl`	The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2019	B	`conf`	Trustworthy Graph Algorithms (Invited Talk). MFCS Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
2019	J	`jnl`	Trustworthy Graph Algorithms. CoRR Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
2019	J	`jnl`	Two results on slime mold computations. Theor. Comput. Sci. Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
2018	A*	`conf`	Approximating the Nash Social Welfare with Budget-Additive Valuations. SODA Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2018	—	`conf`	Combinatorial Algorithms for General Linear Arrow-Debreu Markets. FSTTCS Bhaskar Ray Chaudhury, Kurt Mehlhorn
2018	J	`jnl`	Combinatorial Algorithms for General Linear Arrow-Debreu Markets. CoRR Bhaskar Ray Chaudhury, Kurt Mehlhorn
2018	J	`jnl`	Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. J. Symb. Comput. Przemyslaw Koprowski, Kurt Mehlhorn, Saurabh Ray
2018	B	`conf`	Multi-Finger Binary Search Trees. ISAAC Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018	J	`jnl`	Multi-finger binary search trees. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018	—	`conf`	On Fair Division for Indivisible Items. FSTTCS Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn
2018	J	`jnl`	On Fair Division of Indivisible Items. CoRR Yun Kuen Cheung, Bhaskar Chaudhuri, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn
2018	J	`jnl`	On testing substitutability. CoRR Cosmina Croitoru, Kurt Mehlhorn
2018	J	`jnl`	On testing substitutability. Inf. Process. Lett. Cosmina Croitoru, Kurt Mehlhorn
2018	J	`jnl`	The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2017	J	`jnl`	Approximating the Nash Social Welfare with Budget-Additive Valuations. CoRR Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2017	J	`jnl`	Certifying 3-Edge-Connectivity. Algorithmica Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
2017	B	`conf`	Earning Limits in Fisher Markets with Spending-Constraint Utilities. SAGT Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2017	J	`jnl`	Engineering DFS-Based Graph Algorithms. CoRR Kurt Mehlhorn, Stefan Näher, Peter Sanders
2017	J	`jnl`	Two Results on Slime Mold Computations. CoRR Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
2016	A	`conf`	A Note On Spectral Clustering. ESA Pavel Kolev, Kurt Mehlhorn
2016	J	`jnl`	A still simpler way of introducing interior-point method for linear programming. Comput. Sci. Rev. Kurt Mehlhorn, Sanjeev Saxena
2016	A*	`conf`	An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. SODA Ran Duan, Jugal Garg, Kurt Mehlhorn
2016	J	`jnl`	An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. CoRR Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn
2016	A	`conf`	Computing Equilibria in Markets with Budget-Additive Utilities. ESA Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2016	J	`jnl`	Computing Equilibria in Markets with Budget-Additive Utilities. CoRR Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
2016	J	`jnl`	Computing real roots of real polynomials. J. Symb. Comput. Michael Sagraloff, Kurt Mehlhorn
2016	J	`jnl`	Fair Matchings and Related Problems. Algorithmica Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2016	J	`jnl`	Improved balanced flow computation using parametric flow. Inf. Process. Lett. Omar Darwish, Kurt Mehlhorn
2016	B	`conf`	Opposition Frameworks. JELIA Cosmina Croitoru, Kurt Mehlhorn
2016	J	`jnl`	The landscape of bounds for binary search trees. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2016	J	`jnl`	Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. Theory Comput. Syst. Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
2015	J	`jnl`	A Global Geometric View of Splaying. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	A Note On Spectral Clustering. CoRR Pavel Kolev, Kurt Mehlhorn
2015	J	`jnl`	A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. CoRR Kurt Mehlhorn, Sanjeev Saxena
2015	J	`jnl`	A combinatorial polynomial algorithm for the linear Arrow-Debreu market. Inf. Comput. Ran Duan, Kurt Mehlhorn
2015	J	`jnl`	An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. CoRR Ran Duan, Jugal Garg, Kurt Mehlhorn
2015	J	`jnl`	From approximate factorization to root isolation with application to cylindrical algebraic decomposition. J. Symb. Comput. Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
2015	B	`conf`	Greedy Is an Almost Optimal Deque. WADS Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	Greedy Is an Almost Optimal Deque. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	Improved Balanced Flow Computation Using Parametric Flow. CoRR Omar Darwish, Kurt Mehlhorn
2015	J	`jnl`	On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
2015	—	`conf`	On the Implementation of Combinatorial Algorithms for the Linear Exchange Market. Algorithms, Probability, Networks, and Games Kurt Mehlhorn
2015	—	`conf`	P. polycephalum Can Compute Shortest Paths. BICT Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn, Girish Varma
2015	A*	`conf`	Pattern-Avoiding Access in Binary Search Trees. FOCS Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	J	`jnl`	Pattern-avoiding access in binary search trees. CoRR Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	A	`conf`	Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015	B	`conf`	Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design. SAGT Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
2015	—	`conf`	Towards an open online repository of P. polycephalum networks and their corresponding graph representations. BICT Michael Dirnberger, Tim Kehl, Tim Mehlhorn, Kurt Mehlhorn, Adrian Neumann
2014	J	`jnl`	A Framework for the Verification of Certifying Computations. J. Autom. Reason. Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
2014	—	`book`	Algorithmen und Datenstrukturen - die Grundwerkzeuge. Martin Dietzfelbinger, Kurt Mehlhorn, Peter Sanders
2014	B	`conf`	Algorithms for Equilibrium Prices in Linear Market Models. WALCOM Kurt Mehlhorn
2014	J	`jnl`	Cache-Oblivious VAT-Algorithms. CoRR Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick K. Nicholson
2014	J	`jnl`	Equilibrium Computation (Dagstuhl Seminar 14342). Dagstuhl Reports Nimrod Megiddo, Kurt Mehlhorn, Rahul Savani, Vijay V. Vazirani
2014	J	`jnl`	Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Algorithmica Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
2014	—	`conf`	New Approximability Results for the Robust k-Median Problem. SWAT Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
2014	J	`jnl`	On a Model of Virtual Address Translation. ACM J. Exp. Algorithmics Tomasz Jurkiewicz, Kurt Mehlhorn
2014	J	`jnl`	Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. CoRR Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
2014	—	`conf`	Verification of Certifying Computations through AutoCorres and Simpl. NASA Formal Methods Lars Noschinski, Christine Rizkallah, Kurt Mehlhorn
2013	—	`conf`	A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. ICALP (1) Ran Duan, Kurt Mehlhorn
2013	J	`jnl`	A Framework for the Verification of Certifying Computations CoRR Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
2013	B	`conf`	Certifying 3-Edge-Connectivity. WG Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
2013	J	`jnl`	Computational Geometry (Dagstuhl Seminar 13101). Dagstuhl Reports Otfried Cheong, Kurt Mehlhorn, Monique Teillaud
2013	J	`jnl`	Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration. CoRR Michael Sagraloff, Kurt Mehlhorn
2013	J	`jnl`	Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
2013	—	`conf`	Fair Matchings and Related Problems. FSTTCS Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2013	J	`jnl`	From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition CoRR Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
2013	B	`conf`	From approximate factorization to root isolation. ISSAC Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
2013	J	`jnl`	New Approximability Results for the Robust k-Median Problem. CoRR Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
2013	J	`jnl`	On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets CoRR Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
2013	Misc	`conf`	On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
2013	—	`conf`	Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. ICALP (2) Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn
2013	A	`conf`	Physarum Computations (Invited talk). STACS Kurt Mehlhorn
2013	—	`conf`	The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2013	A	`conf`	The cost of address translation. ALENEX Tomasz Jurkiewicz, Kurt Mehlhorn
2012	J	`jnl`	A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market CoRR Ran Duan, Kurt Mehlhorn
2012	J	`jnl`	An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
2012	—	`ed.`	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I ICALP (1) Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer
2012	—	`ed.`	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II ICALP (2) Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer
2012	J	`jnl`	CGTA-Awards 2011. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack
2012	J	`jnl`	Certifying 3-Edge-Connectivity CoRR Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
2012	—	`conf`	Counting Arbitrary Subgraphs in Data Streams. ICALP (2) Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun
2012	J	`jnl`	Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms CoRR George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
2012	J	`jnl`	Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer
2012	A*	`conf`	Physarum can compute shortest paths. SODA Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma
2012	J	`jnl`	Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). Dagstuhl Reports Kurt Mehlhorn, Moshe Y. Vardi, Marc Herbstritt
2012	J	`jnl`	Remarks on Category-Based Routing in Social Networks CoRR Karl Bringmann, Kurt Mehlhorn, Adrian Neumann
2012	J	`jnl`	The Cost of Address Translation CoRR Tomasz Jurkiewicz, Kurt Mehlhorn
2012	J	`jnl`	The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn
2011	J	`jnl`	A deterministic algorithm for isolating real roots of a real polynomial. J. Symb. Comput. Kurt Mehlhorn, Michael Sagraloff
2011	J	`jnl`	A general approach to the analysis of controlled perturbation algorithms. Comput. Geom. Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
2011	J	`jnl`	An Introduction to Certifying Algorithms. it Inf. Technol. Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer
2011	A	`conf`	Approximate Counting of Cycles in Streams. ESA Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun
2011	J	`jnl`	Certifying algorithms. Comput. Sci. Rev. Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer
2011	J	`jnl`	Computational Geometry (Dagstuhl Seminar 11111). Dagstuhl Reports Pankaj K. Agarwal, Kurt Mehlhorn, Monique Teillaud
2011	J	`jnl`	Guest Editorial: Selected Papers from European Symposium on Algorithms. Algorithmica Dan Halperin, Kurt Mehlhorn
2011	A	`conf`	Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. ESA George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
2011	—	`ch.`	Multiplication of Long Integers - Faster than Long Multiplication. Algorithms Unplugged Arno Eigenwillig, Kurt Mehlhorn
2011	J	`jnl`	New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2011	—	`conf`	Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer
2011	J	`jnl`	Physarum Can Compute Shortest Paths CoRR Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma
2011	B	`conf`	The Physarum Computer. WALCOM Kurt Mehlhorn
2011	A*	`conf`	Verification of Certifying Computations. CAV Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
2011	J	`jnl`	Weisfeiler-Lehman Graph Kernels. J. Mach. Learn. Res. Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt
2010	J	`jnl`	Additive spanners and (alpha, beta)-spanners. ACM Trans. Algorithms Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
2010	J	`jnl`	Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
2010	J	`jnl`	Assigning Papers to Referees. Algorithmica Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre
2010	J	`jnl`	Editorial. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack
2010	J	`jnl`	Faster algorithms for computing Hong's bound on absolute positiveness. J. Symb. Comput. Kurt Mehlhorn, Saurabh Ray
2010	Misc	`conf`	Progress on Certifying Algorithms. FAW Kurt Mehlhorn, Pascal Schweitzer
2010	—	`conf`	Reliable and Efficient Geometric Computing. ICMS Kurt Mehlhorn
2009	J	`jnl`	A Separation Bound for Real Algebraic Expressions. Algorithmica Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
2009	—	`conf`	Assigning Papers to Referees. ICALP (1) Kurt Mehlhorn
2009	A	`conf`	Breaking the O(m ESA Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi
2009	J	`jnl`	Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina A. Zweig
2009	A	`conf`	Efficient graphlet kernels for large graph comparison. AISTATS Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, Karsten M. Borgwardt
2009	B	`conf`	Isolating real roots of real polynomials. ISSAC Kurt Mehlhorn, Michael Sagraloff
2009	J	`jnl`	Minimum cycle bases: Faster and simpler. ACM Trans. Algorithms Kurt Mehlhorn, Dimitrios Michail
2009	J	`jnl`	Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks
2008	A	`ed.`	Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings ESA Dan Halperin, Kurt Mehlhorn
2008	—	`book`	Algorithms and Data Structures: The Basic Toolbox. Kurt Mehlhorn, Peter Sanders
2008	J	`jnl`	An [( Algorithmica Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2008	J	`jnl`	Classroom examples of robustness problems in geometric computations. Comput. Geom. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
2008	J	`jnl`	Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
2008	—	`ch.`	Multiplikation langer Zahlen (schneller als in der Schule). Taschenbuch der Algorithmen Arno Eigenwillig, Kurt Mehlhorn
2007	J	`jnl`	Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. Telikepalli Kavitha, Kurt Mehlhorn
2007	J	`jnl`	Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput. Geom. Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn
2007	J	`jnl`	Cycle bases of graphs and sampled manifolds. Comput. Aided Geom. Des. Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, Evangelia Pyrga
2007	C	`conf`	Matchings in Graphs Variations of the Problem. COCOA Kurt Mehlhorn
2007	B	`conf`	Minimum Cycle Bases in Graphs Algorithms and Applications. MFCS Kurt Mehlhorn
2007	A	`conf`	New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2007	J	`jnl`	Popular Matchings. SIAM J. Comput. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
2007	J	`jnl`	Strongly stable matchings in time ACM Trans. Algorithms Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2007	A	`conf`	Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
2006	—	`conf`	A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert
2006	—	`conf`	A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
2006	J	`jnl`	Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2006	J	`jnl`	Implementing minimum cycle basis algorithms. ACM J. Exp. Algorithmics Kurt Mehlhorn, Dimitrios Michail
2006	J	`jnl`	Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
2006	J	`jnl`	New bounds for the Descartes method. J. Symb. Comput. Werner Krandick, Kurt Mehlhorn
2006	J	`jnl`	Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2006	J	`jnl`	Rank-maximal matchings. ACM Trans. Algorithms Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2006	—	`conf`	Reliable Geometric Computing. OR Kurt Mehlhorn
2006	—	`conf`	Reliable and Efficient Computational Geometry Via Controlled Perturbation. ICALP (1) Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
2006	C	`conf`	Reliable and Efficient Geometric Computing. CIAC Kurt Mehlhorn
2006	A	`conf`	Reliable and Efficient Geometric Computing. ESA Kurt Mehlhorn
2006	—	`conf`	Reply to "Backward Error Analysis ...". ICCSA (1) Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
2005	B	`conf`	A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
2005	A	`conf`	A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS Telikepalli Kavitha, Kurt Mehlhorn
2005	—	`ed.`	Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn
2005	A*	`conf`	Controlled perturbation for Delaunay triangulations. SODA Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt
2005	A	`conf`	EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert
2005	—	`conf`	Implementing Minimum Cycle Basis Algorithms. WEA Kurt Mehlhorn, Dimitrios Michail
2005	A	`conf`	Minimum Cycle Bases and Surface Reconstruction. GD Kurt Mehlhorn
2005	J	`jnl`	New bounds for the Descartes method. SIGSAM Bull. Werner Krandick, Kurt Mehlhorn
2005	A*	`conf`	New constructions of (alpha, beta)-spanners and purely additive spanners. SODA Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
2005	B	`conf`	Pareto Optimality in House Allocation Problems. ISAAC David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn
2005	A*	`conf`	Popular matchings. SODA David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
2005	J	`jnl`	Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. Stefan Funke, Kurt Mehlhorn, Stefan Näher
2005	A*	`conf`	Towards Optimal Multiple Selection. ICALP Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders
2004	—	`conf`	04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn
2004	A*	`conf`	A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2004	A	`conf`	Classroom Examples of Robustness Problems in Geometric Computations. ESA Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
2004	A	`conf`	Matching Algorithms Are Fast in Sparse Random Graphs. STACS Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
2004	B	`conf`	Pareto Optimality in House Allocation Problems. ISAAC David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn
2004	A*	`conf`	Point containment in the integer hull of a polyhedron. SODA Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn
2004	B	`conf`	Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2004	A*	`conf`	Rank-maximal matchings. SODA Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2004	A	`conf`	Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2003	J	`jnl`	A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica Hannah Bast, Kurt Mehlhorn, Guido Schäfer
2003	J	`jnl`	An efficient graph algorithm for dominance constraints. J. Algorithms Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
2003	A	`conf`	Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. ESA Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
2003	A*	`conf`	Certifying algorithms for recognizing interval graphs and permutation graphs. SODA Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2003	A*	`conf`	Certifying and repairing solutions to large LPs how good are LP-solvers? SODA Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber
2003	J	`jnl`	Infimaximal Frames: A Technique for Making Lines Look Like Segments. Int. J. Comput. Geom. Appl. Kurt Mehlhorn, Michael Seel
2003	J	`jnl`	Optimal search for rationals. Inf. Process. Lett. Stephen Kwek, Kurt Mehlhorn
2003	J	`jnl`	Scanning Multiple Sequences Via Cache Memory. Algorithmica Kurt Mehlhorn, Peter Sanders
2003	B	`conf`	Smoothed Analysis of Three Combinatorial Problems. MFCS Cyril Banderier, René Beier, Kurt Mehlhorn
2003	—	`conf`	The Reliable Algorithmic Software Challenge RASC. Computer Science in Perspective Kurt Mehlhorn
2003	—	`conf`	The Reliable Algorithmic Software Challenge RASC. WEA Kurt Mehlhorn
2002	A	`conf`	A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. ESA Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer
2002	J	`jnl`	All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan
2002	A	`conf`	External-Memory Breadth-First Search with Sublinear I/O. ESA Kurt Mehlhorn, Ulrich Meyer
2002	J	`jnl`	Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. ACM J. Exp. Algorithmics Kurt Mehlhorn, Guido Schäfer
2002	J	`jnl`	LOOK: A Lazy Object-Oriented Kernel design for geometric computation. Comput. Geom. Stefan Funke, Kurt Mehlhorn
2002	A	`conf`	SCIL - Symbolic Constraints in Integer Linear Programming. ESA Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
2001	A	`conf`	A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA Kurt Mehlhorn, Guido Schäfer
2001	A	`conf`	A Separation Bound for Real Algebraic Expressions. ESA Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
2001	A*	`conf`	An efficient algorithm for the configuration problem of dominance graphs. SODA Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
2001	A	`conf`	CNOP - A Package for Constrained Network Optimization. ALENEX Kurt Mehlhorn, Mark Ziegelmann
2001	—	`ch.`	Exact Computation with leda_real - Theory and geometric Applications. Symbolic Algebraic Methods and Verification Methods Kurt Mehlhorn, Stefan Schirra
2001	—	`conf`	Exact geometric computation. HERCMA Kurt Mehlhorn
2001	Misc	`conf`	From Algorithm to Program to Software Library. Informatics Kurt Mehlhorn
2001	J	`jnl`	Furthest Site Abstract Voronoi Diagrams. Int. J. Comput. Geom. Appl. Kurt Mehlhorn, Stefan Meiser, Ronald Rasch
2001	J	`jnl`	Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geom. Appl. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
2001	J	`jnl`	Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. Ernst Althaus, Kurt Mehlhorn
2000	A*	`conf`	A Polynomial-Time Fragment of Dominance Constraints. ACL Alexander Koller, Kurt Mehlhorn, Joachim Niehren
2000	J	`jnl`	A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
2000	J	`jnl`	A polyhedral approach to sequence alignment problems. Discret. Appl. Math. John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron
2000	J	`jnl`	Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
2000	A*	`conf`	Constraint Programming and Graph Algorithms. ICALP Kurt Mehlhorn
2000	J	`jnl`	Curve reconstruction: Connecting dots with good reason. Comput. Geom. Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos
2000	J	`jnl`	Editorial. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack
2000	A	`conf`	Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. CP Kurt Mehlhorn, Sven Thiel
2000	—	`conf`	Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. WAE Kurt Mehlhorn, Guido Schäfer
2000	—	`ed.`	Informatik 2000, Neue Horizonte im neuen Jahrhundert 30. Jahrestagung der Gesellschaft für Informatik Berlin, 19.-22. September 2000. GI Jahrestagung Kurt Mehlhorn, Gregor Snelting
2000	—	`conf`	Look - a Lazy Object-Oriented Kernel for geometric computation. SCG Stefan Funke, Kurt Mehlhorn
2000	A	`conf`	Resource Constrained Shortest Paths. ESA Kurt Mehlhorn, Mark Ziegelmann
2000	A*	`conf`	TSP-based curve reconstruction in polynomial time. SODA Ernst Althaus, Kurt Mehlhorn
1999	J	`jnl`	A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. Srinivasa Rao Arikati, Kurt Mehlhorn
1999	J	`jnl`	An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. Inf. Process. Lett. Joseph Cheriyan, Kurt Mehlhorn
1999	A*	`conf`	Checking Priority Queues. SODA Ulrich Finkler, Kurt Mehlhorn
1999	J	`jnl`	Checking geometric programs or verification of geometric structures. Comput. Geom. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
1999	—	`conf`	Curve Reconstruction: Connecting Dots with Good Reason. SCG Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos
1999	J	`jnl`	Editorial. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia
1999	—	`conf`	Efficient Exact Geometric Computation Made Easy. SCG Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
1999	—	`conf`	LEDA-SM Extending LEDA to Secondary Memory. WAE Andreas Crauser, Kurt Mehlhorn
1999	—	`book`	LEDA: A Platform for Combinatorial and Geometric Computing. Kurt Mehlhorn, Stefan Näher
1999	—	`conf`	Structural filtering: A paradigm for efficient and exact geometric programs. CCCG Stefan Funke, Kurt Mehlhorn, Stefan Näher
1999	—	`conf`	Ten Years of LEDA Some Thoughts (Abstract). WAE Kurt Mehlhorn
1999	B	`conf`	The Engineering of Some Bipartite Matching Programs. ISAAC Kurt Mehlhorn
1999	—	`conf`	The Engineering of some Bipartite Matching Programs. FSTTCS Kurt Mehlhorn
1998	B	`conf`	A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders
1998	J	`jnl`	A computational basis for higher-dimensional computational geometry and applications. Comput. Geom. Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
1998	—	`ed.`	Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings WAE Kurt Mehlhorn
1998	—	`conf`	From Algorithms to Working Programs on the Use of Program Checking in LEDA. IFIP Congress: Fundamentals - Foundations of Computer Science Kurt Mehlhorn, Stefan Näher
1998	B	`conf`	From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS Kurt Mehlhorn, Stefan Näher
1998	—	`ed.`	Fundamentals - Foundations of Computer Science, IFIP World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary IFIP Congress: Fundamentals - Foundations of Computer Science Kurt Mehlhorn
1998	—	`conf`	I/O-optimal computation of segment intersections. External Memory Algorithms Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
1998	J	`jnl`	Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. Ernst Althaus, Kurt Mehlhorn
1998	—	`conf`	Randomized External-Memory Algorithms for Some Geometric Problems. SCG Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
1997	—	`conf`	A Complete Roundness Classification Procedure. SCG Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
1997	—	`conf`	A Computational Basis for Higher-Dimensional Computational Geometry and Applications. SCG Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
1997	—	`conf`	A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem. WAE Ulrike Bartuschka, Kurt Mehlhorn, Stefan Näher
1997	A*	`conf`	A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
1997	B	`conf`	A branch-and-cut algorithm for multiple sequence alignment. RECOMB Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu
1997	—	`conf`	Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
1997	J	`jnl`	Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica Kurt Mehlhorn, R. Sundar, Christian Uhrig
1997	J	`jnl`	On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms Kurt Mehlhorn, Volker Priebe
1997	A*	`conf`	Runtime Prediction of Real Programs on Real Machines. SODA Ulrich Finkler, Kurt Mehlhorn
1997	A*	`conf`	The LEDA Platform of Combinatorial and Geometric Computing. ICALP Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1996	J	`jnl`	A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson
1996	J	`jnl`	Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica Joseph Cheriyan, Kurt Mehlhorn
1996	J	`jnl`	An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
1996	—	`conf`	Checking Geometric Programs or Verification of Geometric Structures. SCG Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
1996	J	`jnl`	On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica Kurt Mehlhorn, Petra Mutzel
1996	—	`conf`	Position Paper for Panel Discussion. WACG Kurt Mehlhorn
1996	—	`conf`	The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1995	J	`jnl`	A Communication-Randomness Tradeoff for Two-Processor Systems Inf. Comput. Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
1995	—	`conf`	Exact Geometric Computation in LEDA. SCG Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1995	B	`conf`	Experiences with the Implementation of Geometric Algorithms (Abstract). WADS Kurt Mehlhorn
1995	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. Kurt Mehlhorn
1995	J	`jnl`	LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM Kurt Mehlhorn, Stefan Näher
1995	J	`jnl`	Lower Bounds for Set Intersection Queries. Algorithmica Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1995	A	`conf`	On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. ESA Kurt Mehlhorn, Volker Priebe
1994	J	`jnl`	A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM J. Comput. Michael Kaufmann, Kurt Mehlhorn
1994	J	`jnl`	A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
1994	J	`jnl`	Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
1994	J	`jnl`	Dynamic Point Location in General Subdivisions. J. Algorithms Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn
1994	A	`conf`	How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. ESA Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra
1994	A*	`conf`	Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA Kurt Mehlhorn, R. Sundar, Christian Uhrig
1994	A*	`conf`	On Degeneracy in Geometric Computations. SODA Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra
1994	—	`ed.`	Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994 SCG Kurt Mehlhorn
1994	—	`conf`	The Implementation of Geometric Algorithms. IFIP Congress (1) Kurt Mehlhorn, Stefan Näher
1993	B	`conf`	A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. WADS Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec
1993	J	`jnl`	Dynamic Interpolation Search. J. ACM Kurt Mehlhorn, Athanasios K. Tsakalidis
1993	A	`conf`	Exact Algorithms for a Geometric Packing Problem (Extended Abstract). STACS Ludek Kucera, Kurt Mehlhorn, B. Preis, Erik Schwarzenecker
1993	J	`jnl`	Four Results on Randomized Incremental Constructions. Comput. Geom. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
1993	—	`conf`	Komplexitätstheorie und Algorithmik. Perspektiven der Informatik Kurt Mehlhorn, Volker Claus, Wolfgang Thomas
1993	A*	`conf`	Lower Bounds for Set Intersection Queries. SODA Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1993	A*	`conf`	Maintaining Discrete Probability Distributions Optimally. ICALP Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
1993	J	`jnl`	Randomized Incremental Construction of Abstract Voronoi Diagrams. Comput. Geom. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
1993	—	`conf`	Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. FSTTCS Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel
1993	J	`jnl`	Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. Kurt Mehlhorn, Micha Sharir, Emo Welzl
1992	J	`jnl`	A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. Helmut Alt, Viliam Geffert, Kurt Mehlhorn
1992	—	`conf`	Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) Kurt Mehlhorn, Stefan Näher
1992	J	`jnl`	Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1992	A*	`conf`	Dynamic Point Location in General Subdivisions. SODA Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn
1992	A	`conf`	Four Results on Randomized Incremental Constructions. STACS Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
1992	J	`jnl`	On local routing of two-terminal nets. J. Comb. Theory B Michael Kaufmann, Kurt Mehlhorn
1992	—	`ch.`	Randomized Incremental Construction of Abstract Voronoi Diagrams. Informatik Rolf Klein, Kurt Mehlhorn, Stefan Meiser
1992	—	`conf`	Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). FSTTCS Kurt Mehlhorn
1992	—	`conf`	Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
1992	J	`jnl`	Simultaneous Inner and Outer Approximation of Shapes. Algorithmica Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1992	A*	`conf`	Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA Kurt Mehlhorn, Micha Sharir, Emo Welzl
1992	J	`jnl`	k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs Inf. Comput. Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig
1991	J	`jnl`	Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
1991	J	`jnl`	Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. Kurt Mehlhorn, Chee-Keng Yap
1991	J	`jnl`	On the Construction of Abstract Voronoi Diagrams. Discret. Comput. Geom. Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
1990	—	`conf`	A Time-Randomness Tradeoff for Communication Complexity. WDAG Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn
1990	J	`jnl`	A faster compaction algorithm with automatic jog insertion. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Kurt Mehlhorn, Stefan Näher
1990	—	`conf`	Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1990	J	`jnl`	Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Inf. Process. Lett. Kurt Mehlhorn, Stefan Näher
1990	A*	`conf`	Can A Maximum Flow be Computed on o(nm) Time? ICALP Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
1990	J	`jnl`	Compaction on the torus [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Kurt Mehlhorn, Wolfgang Rülling
1990	—	`ch.`	Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Kurt Mehlhorn, Athanasios K. Tsakalidis
1990	J	`jnl`	Dynamic Deferred Data Structuring. Inf. Process. Lett. Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid
1990	J	`jnl`	Dynamic Fractional Cascading. Algorithmica Kurt Mehlhorn, Stefan Näher
1990	J	`jnl`	Faster Algorithms for the Shortest Path Problem J. ACM Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan
1990	J	`jnl`	Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1990	—	`conf`	LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) Stefan Näher, Kurt Mehlhorn
1990	A*	`conf`	LEDA: A Library of Efficient Data Types and Algorithms. ICALP Stefan Näher, Kurt Mehlhorn
1990	—	`conf`	On Simultaneous Inner and Outer Approximation of Shapes. SCG Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1990	J	`jnl`	On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. Kurt Mehlhorn, Stefan Näher, Monika Rauch
1990	—	`conf`	On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms Rolf Klein, Kurt Mehlhorn, Stefan Meiser
1990	A	`conf`	On the Construction of Abstract Voronoi Diagrams. STACS Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
1989	J	`jnl`	AT²-Optimal Galois Field Multiplier for VLSI. IEEE Trans. Computers Martin Fürer, Kurt Mehlhorn
1989	—	`book`	Foundations of Programming Languages Jacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm
1989	B	`conf`	LEDA: A Library of Efficient Data Types and Algorithms. MFCS Kurt Mehlhorn, Stefan Näher
1989	A*	`conf`	On the Complexity of a Game Related to the Dictionary Problem FOCS Kurt Mehlhorn, Stefan Näher, Monika Rauch
1989	—	`ed.`	Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989 SCG Kurt Mehlhorn
1989	A*	`conf`	Two Versus One Index Register and Modifiable Versus Non-modifiable Programs. ICALP Kurt Mehlhorn, Wolfgang J. Paul
1988	J	`jnl`	A Faster Approximation Algorithm for the Steiner Problem in Graphs. Inf. Process. Lett. Kurt Mehlhorn
1988	J	`jnl`	A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. Kurt Mehlhorn, Stefan Näher, Helmut Alt
1988	—	`conf`	Compaction on the Torus. AWOC Kurt Mehlhorn, Wolfgang Rülling
1988	J	`jnl`	Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1988	A*	`conf`	Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP Kurt Mehlhorn, Chee-Keng Yap
1988	A*	`conf`	Dynamic Perfect Hashing: Upper and Lower Bounds FOCS Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
1988	A*	`conf`	On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
1988	—	`conf`	On Continuous Homotopic One Layer Routing. SCG Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
1988	J	`jnl`	Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Inf. Process. Lett. Hermann Jung, Kurt Mehlhorn
1988	—	`conf`	SFB 124: VLSI-Entwurfsmethoden und Parallelität. GI Jahrestagung (2) Kurt Mehlhorn, Gerhard Zimmermann
1988	—	`conf`	Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert
1987	A*	`conf`	A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP Kurt Mehlhorn, Stefan Näher, Helmut Alt
1987	J	`jnl`	A log log n Data Structure for Three-Sided Range Queries. Inf. Process. Lett. Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis
1987	J	`jnl`	Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) Inf. Comput. Kurt Mehlhorn, Franco P. Preparata
1987	—	`conf`	Congruence, Similarity, and Symmetries of Geometric Objects. SCG Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1987	J	`jnl`	Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1987	—	`conf`	Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1987	A	`conf`	On Local Routing of Two-Terminal Nets. STACS Michael Kaufmann, Kurt Mehlhorn
1987	—	`ed.`	Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings Parallel Algorithms and Architectures Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn
1986	—	`conf`	AT Aegean Workshop on Computing Martin Fürer, Kurt Mehlhorn
1986	J	`jnl`	Algorithms for Routing in Planar Graphs. Acta Informatica Michael Becker, Kurt Mehlhorn
1986	J	`jnl`	An Amortized Analysis of Insertions into AVL-Trees. SIAM J. Comput. Kurt Mehlhorn, Athanasios K. Tsakalidis
1986	A	`conf`	Area-time Optimal Division for T=Omega(log n) STACS Kurt Mehlhorn, Franco P. Preparata
1986	J	`jnl`	Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh
1986	B	`conf`	Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1986	—	`book`	Grundlagen der Programmiersprachen Jacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm
1986	J	`jnl`	On BF-orderable graphs. Discret. Appl. Math. Kurt Mehlhorn, Bernd H. Schmidt
1986	J	`jnl`	Routing Through a Generalized Switchbox. J. Algorithms Michael Kaufmann, Kurt Mehlhorn
1986	J	`jnl`	Routing through a rectangle. J. ACM Kurt Mehlhorn, Franco P. Preparata
1986	J	`jnl`	Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees Inf. Control. Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan
1986	—	`ed.`	VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings AWOC Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, Paul G. Spirakis
1986	J	`jnl`	Über Verdrahtungsalgorithmen. Inform. Spektrum Kurt Mehlhorn
1985	J	`jnl`	A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. Heikki Mannila, Kurt Mehlhorn
1985	A*	`conf`	Dynamic Interpolation Search. ICALP Kurt Mehlhorn, Athanasios K. Tsakalidis
1985	—	`conf`	Dynamization of geometric data structures. SCG Otfried Fries, Kurt Mehlhorn, Stefan Näher
1985	J	`jnl`	Fast Triangulation of the Plane with Respect to Simple Polygons Inf. Control. Stefan Hertel, Kurt Mehlhorn
1985	B	`conf`	Intersecting two polyhedra one of which is convex. FCT Kurt Mehlhorn, Klaus Simon
1985	A*	`conf`	Routing Through a Generalized Switchbox. ICALP Michael Kaufmann, Kurt Mehlhorn
1985	A	`ed.`	STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings STACS Kurt Mehlhorn
1985	J	`jnl`	Searching Semisorted Tables. SIAM J. Comput. Helmut Alt, Kurt Mehlhorn
1985	—	`conf`	Sorting Jordan sequences in linear time. SCG Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan
1984	J	`jnl`	AT Integr. Kurt Mehlhorn
1984	A*	`conf`	Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. ICALP Kurt Mehlhorn, Franco P. Preparata
1984	—	`book`	Data Structures and Algorithms 1: Sorting and Searching Kurt Mehlhorn
1984	—	`book`	Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness Kurt Mehlhorn
1984	—	`book`	Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry Kurt Mehlhorn
1984	—	`conf`	On Optimal VLSI-Circuits for the Basic Arithmetic Functions. CAAP Kurt Mehlhorn
1984	J	`jnl`	Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
1984	J	`jnl`	Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica Kurt Mehlhorn, Uzi Vishkin
1984	A	`ed.`	STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings STACS Max Fontet, Kurt Mehlhorn
1984	J	`jnl`	Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt
1984	—	`conf`	Über Verdrahtungsalgorithmen. GI Jahrestagung (Fachgespräche) Kurt Mehlhorn
1983	B	`conf`	A Single Shortest Path Algorithm for Graphs with Separators. FCT Kurt Mehlhorn, Bernd H. Schmidt
1983	J	`jnl`	Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time Inf. Control. Kurt Mehlhorn, Franco P. Preparata
1983	J	`jnl`	Cost Trade-offs in Graph Embeddings, with Applications J. ACM Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
1983	B	`conf`	Fast Triangulation of Simple Polygons. FCT Stefan Hertel, Kurt Mehlhorn
1983	B	`conf`	Granularity of Memory in Parallel Computation. WG Kurt Mehlhorn, Uzi Vishkin
1983	J	`jnl`	The Recognition of Deterministic CFL's in Small Time and Space Inf. Control. Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek
1982	J	`jnl`	A New Data Structure for Representing Sorted Lists. Acta Informatica Scott Huddleston, Kurt Mehlhorn
1982	J	`jnl`	A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. SIAM J. Comput. Kurt Mehlhorn
1982	J	`jnl`	A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter
1982	A*	`conf`	Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract) STOC Kurt Mehlhorn, Erik Meineche Schmidt
1982	A*	`conf`	On the Program Size of Perfect and Universal Hash Functions FOCS Kurt Mehlhorn
1982	J	`jnl`	The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees Inf. Control. Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood
1981	J	`jnl`	Arbitrary Weight Changes in Dynamic Trees. RAIRO Theor. Informatics Appl. Kurt Mehlhorn
1981	A*	`conf`	Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
1981	B	`conf`	Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. WG Kurt Mehlhorn
1981	J	`jnl`	Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures. Math. Syst. Theory Kurt Mehlhorn
1981	J	`jnl`	Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. Kurt Mehlhorn, Mark H. Overmars
1981	B	`conf`	Partial Match Retrieval in Implicit Data Structures. MFCS Helmut Alt, Kurt Mehlhorn, J. Ian Munro
1981	—	`conf`	Robust Balancing in B-Trees. Theoretical Computer Science Scott Huddleston, Kurt Mehlhorn
1980	B	`conf`	A New Data Structure for Representing Sorted Lists. WG Kurt Mehlhorn
1980	J	`jnl`	An efficient algorithm for constructing nearly optimal prefix codes. IEEE Trans. Inf. Theory Kurt Mehlhorn
1980	J	`jnl`	Binary Search Trees: Average and Worst Case Behavior. J. Inf. Process. Cybern. Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider
1980	J	`jnl`	Codes: Unequal Probabilities, Unequal Letter Cost. J. ACM Doris Altenkamp, Kurt Mehlhorn
1980	J	`jnl`	On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. Norbert Blum, Kurt Mehlhorn
1980	A*	`conf`	Pebbling Moutain Ranges and its Application of DCFL-Recognition. ICALP Kurt Mehlhorn
1979	J	`jnl`	Complexity arguments in algebraic language theory. RAIRO Theor. Informatics Appl. Helmut Alt, Kurt Mehlhorn
1979	J	`jnl`	Dynamic Binary Search. SIAM J. Comput. Kurt Mehlhorn
1979	—	`conf`	Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. GI Jahrestagung Kurt Mehlhorn
1979	—	`conf`	Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science Norbert Blum, Kurt Mehlhorn
1979	J	`jnl`	Parsing Macro Grammars Top Down Inf. Control. Kurt Mehlhorn
1979	B	`conf`	Searching, Sorting and Information Theory. MFCS Kurt Mehlhorn
1979	B	`conf`	Some Remarks on Boolean Sums. MFCS Kurt Mehlhorn
1979	J	`jnl`	Some Remarks on Boolean Sums. Acta Informatica Kurt Mehlhorn
1979	—	`conf`	Sorting Presorted Files. Theoretical Computer Science Kurt Mehlhorn
1978	A*	`conf`	Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). ICALP Doris Altenkamp, Kurt Mehlhorn
1978	J	`jnl`	Effiziente Algorithmen: Ein Beispiel. Inform. Spektrum Kurt Mehlhorn
1977	J	`jnl`	A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM J. Comput. Kurt Mehlhorn
1977	A*	`conf`	Dynamic Binary Search. ICALP Kurt Mehlhorn
1977	—	`book`	Effiziente Algorithmen Kurt Mehlhorn
1977	J	`jnl`	Van Wijngaarden Grammars and Space Complexity Classs EXSPACE. Acta Informatica Peter Deussen, Kurt Mehlhorn
1976	J	`jnl`	An Improved Lower Bound on the Formula Complexity of Context-free Recognition. J. Inf. Process. Cybern. Kurt Mehlhorn
1976	—	`conf`	Binary Search Trees: Average and Worst Case Behavior. GI Jahrestagung Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider, Norbert Wernet
1976	J	`jnl`	Bracket-Languages are Recognizable in Logarithmic Space. Inf. Process. Lett. Kurt Mehlhorn
1976	A*	`conf`	Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP Helmut Alt, Kurt Mehlhorn
1976	J	`jnl`	Monotone switching circuits and boolean matrix product. Computing Kurt Mehlhorn, Zvi Galil
1976	J	`jnl`	Polynomial and Abstract Subrecursive Classes. J. Comput. Syst. Sci. Kurt Mehlhorn
1976	—	`conf`	Top Down Parsing of Macro Grammars. GI Jahrestagung Manfred Heydthausen, Kurt Mehlhorn
1975	J	`jnl`	A language over a one symbol alphabet requiring only O (log log n) space. SIGACT News Helmut Alt, Kurt Mehlhorn
1975	—	`conf`	Best possible bounds for the weighted path length of optimum binary search trees. Automata Theory and Formal Languages Kurt Mehlhorn
1975	B	`conf`	Monotone Switching Circuits and Boolean Matrix Product. MFCS Kurt Mehlhorn, Zvi Galil
1975	J	`jnl`	Nearly Optimal Binary Search Trees. Acta Informatica Kurt Mehlhorn
1974	A*	`conf`	Polynomial and Abstract Subrecursive Classes STOC Kurt Mehlhorn
1974	—	`—`	Polynomial and Abstract Subrecursive Classes. Kurt Mehlhorn
1974	A*	`conf`	The "Almost All" Theory of Subrecursive Degrees is Decidable. ICALP Kurt Mehlhorn
1973	—	`conf`	On the Size of Sets of Computable Functions SWAT Kurt Mehlhorn