Stop the war!Остановите войну!
for scientists:
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
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[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]- [i52]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) - 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 Introdu