Kurt Mehlhorn

ORCID

Publication Activity (10 Years)

Years Active: 1973-2024
Publications (10 Years): 64

Top Venues

Publications

Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
EFX Exists for Three Agents. J. ACM 71 (1) (2024)
Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi
Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity. CoRR (2024)
Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Satiation in Fisher Markets and Approximation of Nash Social Welfare. Math. Oper. Res. 49 (2) (2024)
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
Fair and Efficient Allocation of Indivisible Chores with Surplus. CoRR (2023)
Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR (2023)
Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS (2023)
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI (2023)
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)
Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek
Improving Order with Queues. CoRR (2022)
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 (2022)
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 (2022)
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) (2022)
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
EFX Allocations: Simplifications and Improvements. CoRR (2022)
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)
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 (2022)
Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande
Nash Social Welfare for 2-value Instances. CoRR (2021)
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
Improving EFX Guarantees through Rainbow Cycle Number. EC (2021)
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
Improving EFX Guarantees through Rainbow Cycle Number. CoRR (2021)
Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. 50 (4) (2021)
Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Convergence of the non-uniform Physarum dynamics. Theor. Comput. Sci. 816 (2020)
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
The Maximum-Level Vertex in an Arrangement of Lines. CoRR (2020)
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
EFX Exists for Three Agents. CoRR (2020)
Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
A Little Charity Guarantees Almost Envy-Freeness. SODA (2020)
Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande
Physarum Multi-Commodity Flow Dynamics. CoRR (2020)
Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Convergence of the non-uniform directed Physarum model. Theor. Comput. Sci. 816 (2020)
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
EFX Exists for Three Agents. EC (2020)
Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Convergence of the Non-Uniform Physarum Dynamics. CoRR (2019)
Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Two results on slime mold computations. Theor. Comput. Sci. 773 (2019)
Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
Trustworthy Graph Algorithms. CoRR (2019)
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 (2019)
Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
Trustworthy Graph Algorithms (Invited Talk). MFCS (2019)
Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Earning and Utility Limits in Fisher Markets. ACM Trans. Economics and Comput. 7 (2) (2019)
Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland
Ratio-Balanced Maximum Flows. CoRR (2019)
Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Convergence of the Non-Uniform Directed Physarum Model. CoRR (2019)
Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland
Ratio-balanced maximum flows. Inf. Process. Lett. 150 (2019)
Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
A Little Charity Guarantees Almost Envy-Freeness. CoRR (2019)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Multi-Finger Binary Search Trees. ISAAC (2018)
Yun Kuen Cheung, Bhaskar Chaudhuri, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn
On Fair Division of Indivisible Items. CoRR (2018)
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR (2018)
Cosmina Croitoru, Kurt Mehlhorn
On testing substitutability. Inf. Process. Lett. 138 (2018)
Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Approximating the Nash Social Welfare with Budget-Additive Valuations. SODA (2018)
Cosmina Croitoru, Kurt Mehlhorn
On testing substitutability. CoRR (2018)
Bhaskar Ray Chaudhury, Kurt Mehlhorn
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. CoRR (2018)
Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn
On Fair Division for Indivisible Items. FSTTCS (2018)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Multi-finger binary search trees. CoRR (2018)
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 (2018)
Bhaskar Ray Chaudhury, Kurt Mehlhorn
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. FSTTCS (2018)
Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Earning Limits in Fisher Markets with Spending-Constraint Utilities. SAGT (2017)
Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Two Results on Slime Mold Computations. CoRR (2017)
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
Certifying 3-Edge-Connectivity. Algorithmica 77 (2) (2017)
Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Approximating the Nash Social Welfare with Budget-Additive Valuations. CoRR (2017)
Kurt Mehlhorn, Stefan Näher, Peter Sanders
Engineering DFS-Based Graph Algorithms. CoRR (2017)
Omar Darwish, Kurt Mehlhorn
Improved balanced flow computation using parametric flow. Inf. Process. Lett. 116 (9) (2016)
Michael Sagraloff, Kurt Mehlhorn
Computing real roots of real polynomials. J. Symb. Comput. 73 (2016)
Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Computing Equilibria in Markets with Budget-Additive Utilities. ESA (2016)
Kurt Mehlhorn, Sanjeev Saxena
A still simpler way of introducing interior-point method for linear programming. Comput. Sci. Rev. 22 (2016)
Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Computing Equilibria in Markets with Budget-Additive Utilities. CoRR (2016)
Cosmina Croitoru, Kurt Mehlhorn
Opposition Frameworks. JELIA (2016)
Pavel Kolev, Kurt Mehlhorn
A Note On Spectral Clustering. ESA (2016)
Ran Duan, Jugal Garg, Kurt Mehlhorn
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. SODA (2016)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
The landscape of bounds for binary search trees. CoRR (2016)
Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. Theory Comput. Syst. 59 (4) (2016)
Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
Fair Matchings and Related Problems. Algorithmica 74 (3) (2016)
Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. CoRR (2016)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Pattern-avoiding access in binary search trees. CoRR (2015)
Omar Darwish, Kurt Mehlhorn
Improved Balanced Flow Computation Using Parametric Flow. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
A Global Geometric View of Splaying. CoRR (2015)
Pavel Kolev, Kurt Mehlhorn
A Note On Spectral Clustering. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Greedy Is an Almost Optimal Deque. CoRR (2015)
Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design. SAGT (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Greedy Is an Almost Optimal Deque. WADS (2015)
Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. J. Symb. Comput. 66 (2015)
Kurt Mehlhorn, Sanjeev Saxena
A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. CoRR (2015)
Kurt Mehlhorn
On the Implementation of Combinatorial Algorithms for the Linear Exchange Market. Algorithms, Probability, Networks, and Games (2015)
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)
Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn, Girish Varma
P. polycephalum Can Compute Shortest Paths. BICT (2015)
Ran Duan, Kurt Mehlhorn
A combinatorial polynomial algorithm for the linear Arrow-Debreu market. Inf. Comput. 243 (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA (2015)
Ran Duan, Jugal Garg, Kurt Mehlhorn
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. CoRR (2015)
Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica 73 (2) (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Pattern-Avoiding Access in Binary Search Trees. FOCS (2015)
Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Algorithmica 69 (3) (2014)
Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
New Approximability Results for the Robust k-Median Problem. SWAT (2014)
Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick K. Nicholson
Cache-Oblivious VAT-Algorithms. CoRR (2014)
Nimrod Megiddo, Kurt Mehlhorn, Rahul Savani, Vijay V. Vazirani
Equilibrium Computation (Dagstuhl Seminar 14342). Dagstuhl Reports 4 (8) (2014)
Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
A Framework for the Verification of Certifying Computations. J. Autom. Reason. 52 (3) (2014)
Lars Noschinski, Christine Rizkallah, Kurt Mehlhorn
Verification of Certifying Computations through AutoCorres and Simpl. NASA Formal Methods (2014)
Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. CoRR (2014)
Kurt Mehlhorn
Algorithms for Equilibrium Prices in Linear Market Models. WALCOM (2014)
Tomasz Jurkiewicz, Kurt Mehlhorn
On a Model of Virtual Address Translation. ACM J. Exp. Algorithmics 19 (1) (2014)
Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON (2013)
Tomasz Jurkiewicz, Kurt Mehlhorn
The cost of address translation. ALENEX (2013)
Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
From approximate factorization to root isolation. ISSAC (2013)
Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
A Framework for the Verification of Certifying Computations CoRR (2013)
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
Certifying 3-Edge-Connectivity. WG (2013)
Michael Sagraloff, Kurt Mehlhorn
Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration. CoRR (2013)
Kurt Mehlhorn
Physarum Computations (Invited talk). STACS (2013)
Ran Duan, Kurt Mehlhorn
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. ICALP (1) (2013)
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72 (1) (2013)
Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
New Approximability Results for the Robust k-Median Problem. CoRR (2013)

Kurt Mehlhorn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kurt Mehlhorn