Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini A little charity guarantees almost envy-freeness. (English) Zbl 1525.91102 SIAM J. Comput. 50, No. 4, 1336-1358 (2021). MSC: 91B32 PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., SIAM J. Comput. 50, No. 4, 1336--1358 (2021; Zbl 1525.91102) Full Text: DOI arXiv
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt Faster algorithms for minimum cycle basis in directed graphs. (English) Zbl 1178.68669 SIAM J. Comput. 38, No. 4, 1430-1447 (2008). MSC: 68W20 05C20 68W40 PDFBibTeX XMLCite \textit{R. Hariharan} et al., SIAM J. Comput. 38, No. 4, 1430--1447 (2008; Zbl 1178.68669) Full Text: DOI Link
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt Popular matchings. (English) Zbl 1154.91033 SIAM J. Comput. 37, No. 4, 1030-1045 (2007). MSC: 91B68 05C70 68Q25 PDFBibTeX XMLCite \textit{D. J. Abraham} et al., SIAM J. Comput. 37, No. 4, 1030--1045 (2007; Zbl 1154.91033) Full Text: DOI
Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P. Certifying algorithms for recognizing interval graphs and permutation graphs. (English) Zbl 1113.68112 SIAM J. Comput. 36, No. 2, 326-353 (2006). MSC: 68W40 05C85 68N30 PDFBibTeX XMLCite \textit{D. Kratsch} et al., SIAM J. Comput. 36, No. 2, 326--353 (2006; Zbl 1113.68112) Full Text: DOI
Althaus, Ernst; Mehlhorn, Kurt Traveling salesman-based curve reconstruction in polynomial time. (English) Zbl 0992.68070 SIAM J. Comput. 31, No. 1, 27-66 (2001). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{E. Althaus} and \textit{K. Mehlhorn}, SIAM J. Comput. 31, No. 1, 27--66 (2001; Zbl 0992.68070) Full Text: DOI
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt An \(o(n^ 3)\)-time maximum-flow algorithm. (English) Zbl 0864.68019 SIAM J. Comput. 25, No. 6, 1144-1170 (1996). MSC: 68P05 68W10 68W15 68Q25 68R05 90B10 90C35 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., SIAM J. Comput. 25, No. 6, 1144--1170 (1996; Zbl 0864.68019) Full Text: DOI
Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. Dynamic perfect hashing: Upper and lower bounds. (English) Zbl 0820.68038 SIAM J. Comput. 23, No. 4, 738-761 (1994). MSC: 68P10 68W10 68P05 68Q25 PDFBibTeX XMLCite \textit{M. Dietzfelbinger} et al., SIAM J. Comput. 23, No. 4, 738--761 (1994; Zbl 0820.68038) Full Text: DOI
Kaufmann, Michael; Mehlhorn, Kurt A linear-time algorithm for the homotopic routing problem in grid graphs. (English) Zbl 0803.68057 SIAM J. Comput. 23, No. 2, 227-246 (1994). MSC: 68W35 68Q25 68U05 68R10 PDFBibTeX XMLCite \textit{M. Kaufmann} and \textit{K. Mehlhorn}, SIAM J. Comput. 23, No. 2, 227--246 (1994; Zbl 0803.68057) Full Text: DOI
Mehlhorn, Kurt; Yap, Chee-Keng Constructive Whitney-Graustein theorem: Or how to untangle closed planar curves. (English) Zbl 0736.68030 SIAM J. Comput. 20, No. 4, 603-621 (1991). MSC: 68W10 55M25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{C.-K. Yap}, SIAM J. Comput. 20, No. 4, 603--621 (1991; Zbl 0736.68030) Full Text: DOI
Mehlhorn, K.; Näher, St.; Rauch, M. On the complexity of a game related to the dictionary problem. (English) Zbl 0711.68034 SIAM J. Comput. 19, No. 5, 902-906 (1990). MSC: 68P05 91A05 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., SIAM J. Comput. 19, No. 5, 902--906 (1990; Zbl 0711.68034) Full Text: DOI
Mehlhorn, Kurt; Näher, Stefan; Alt, Helmut A lower bound on the complexity of the union-split-find problem. (English) Zbl 0676.68015 SIAM J. Comput. 17, No. 6, 1093-1102 (1988). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., SIAM J. Comput. 17, No. 6, 1093--1102 (1988; Zbl 0676.68015) Full Text: DOI DOI
Alt, Helmut; Hagerup, Torben; Mehlhorn, Kurt; Preparata, Franco P. Deterministic simulation of idealized parallel computers on more realistic ones. (English) Zbl 0635.68015 SIAM J. Comput. 16, 808-835 (1987). Reviewer: K.Mehlhorn MSC: 68N25 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., SIAM J. Comput. 16, 808--835 (1987; Zbl 0635.68015) Full Text: DOI
Mehlhorn, Kurt; Tsakalidis, Athanasios An amortized analysis of insertions into AVL-trees. (English) Zbl 0589.68048 SIAM J. Comput. 15, 22-33 (1986). MSC: 68P10 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{A. Tsakalidis}, SIAM J. Comput. 15, 22--33 (1986; Zbl 0589.68048) Full Text: DOI
Alt, Helmut; Mehlhorn, Kurt Searching semisorted tables. (English) Zbl 0578.68049 SIAM J. Comput. 14, 840-848 (1985). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{H. Alt} and \textit{K. Mehlhorn}, SIAM J. Comput. 14, 840--848 (1985; Zbl 0578.68049) Full Text: DOI
Mehlhorn, Kurt A partial analysis of height-balanced trees under random insertions and deletions. (English) Zbl 0496.68029 SIAM J. Comput. 11, 748-760 (1982). MSC: 68Q25 68R10 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, SIAM J. Comput. 11, 748--760 (1982; Zbl 0496.68029) Full Text: DOI
Mehlhorn, Kurt Dynamic binary search. (English) Zbl 0408.68056 SIAM J. Comput. 8, 175-198 (1979). MSC: 68R10 68P05 68Q25 94A15 PDFBibTeX XMLCite \textit{K. Mehlhorn}, SIAM J. Comput. 8, 175--198 (1979; Zbl 0408.68056) Full Text: DOI
Mehlhorn, Kurt A best possible bound for the weighted path length of binary search trees. (English) Zbl 0362.68072 SIAM J. Comput. 6, 235-239 (1977). MSC: 68W99 68Q25 68N01 05C05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, SIAM J. Comput. 6, 235--239 (1977; Zbl 0362.68072) Full Text: DOI