Akrami, Hannaneh; Mehlhorn, Kurt; Odland, Tommy Ratio-balanced maximum flows. (English) Zbl 1461.05101 Inf. Process. Lett. 150, 13-17 (2019). MSC: 05C21 05C90 05C85 91B52 PDFBibTeX XMLCite \textit{H. Akrami} et al., Inf. Process. Lett. 150, 13--17 (2019; Zbl 1461.05101) Full Text: DOI arXiv
Croitoru, Cosmina; Mehlhorn, Kurt On testing substitutability. (English) Zbl 1458.68293 Inf. Process. Lett. 138, 19-21 (2018). MSC: 68W40 91B08 91B68 PDFBibTeX XMLCite \textit{C. Croitoru} and \textit{K. Mehlhorn}, Inf. Process. Lett. 138, 19--21 (2018; Zbl 1458.68293) Full Text: DOI arXiv
Darwish, Omar; Mehlhorn, Kurt Improved balanced flow computation using parametric flow. (English) Zbl 1361.91050 Inf. Process. Lett. 116, No. 9, 560-563 (2016). MSC: 91B52 90B10 68Q25 PDFBibTeX XMLCite \textit{O. Darwish} and \textit{K. Mehlhorn}, Inf. Process. Lett. 116, No. 9, 560--563 (2016; Zbl 1361.91050) Full Text: DOI arXiv
Kwek, Stephen; Mehlhorn, Kurt Optimal search for rationals. (English) Zbl 1173.68826 Inf. Process. Lett. 86, No. 1, 23-26 (2003). MSC: 68W05 PDFBibTeX XMLCite \textit{S. Kwek} and \textit{K. Mehlhorn}, Inf. Process. Lett. 86, No. 1, 23--26 (2003; Zbl 1173.68826) Full Text: DOI
Cheriyan, Joseph; Mehlhorn, Kurt An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. (English) Zbl 1338.68097 Inf. Process. Lett. 69, No. 5, 239-242 (1999). MSC: 68Q25 05C21 90C35 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{K. Mehlhorn}, Inf. Process. Lett. 69, No. 5, 239--242 (1999; Zbl 1338.68097) Full Text: DOI Link
Arikati, Srinivasa R.; Mehlhorn, Kurt A correctness certificate for the Stoer-Wagner min-cut algorithm. (English) Zbl 0990.05114 Inf. Process. Lett. 70, No. 5, 251-254 (1999). MSC: 05C85 PDFBibTeX XMLCite \textit{S. R. Arikati} and \textit{K. Mehlhorn}, Inf. Process. Lett. 70, No. 5, 251--254 (1999; Zbl 0990.05114) Full Text: DOI
Althaus, Ernst; Mehlhorn, Kurt Maximum network flow with floating point arithmetic. (English) Zbl 1078.68670 Inf. Process. Lett. 66, No. 3, 109-113 (1998). MSC: 68R10 90C35 PDFBibTeX XMLCite \textit{E. Althaus} and \textit{K. Mehlhorn}, Inf. Process. Lett. 66, No. 3, 109--113 (1998; Zbl 1078.68670) Full Text: DOI
Bilardi, Gianfranco; Chaudhuri, Shiva; Dubhashi, Devdatt; Mehlhorn, K. A lower bound for area-universal graphs. (English) Zbl 0942.68643 Inf. Process. Lett. 51, No. 2, 101-105 (1994). MSC: 68R10 68Q25 68W10 PDFBibTeX XMLCite \textit{G. Bilardi} et al., Inf. Process. Lett. 51, No. 2, 101--105 (1994; Zbl 0942.68643) Full Text: DOI Link
Alt, Helmut; Geffert, Viliam; Mehlhorn, Kurt A lower bound for the nondeterministic space complexity of context-free recognition. (English) Zbl 0780.68081 Inf. Process. Lett. 42, No. 1, 25-27 (1992). MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 42, No. 1, 25--27 (1992; Zbl 0780.68081) Full Text: DOI
Alt, H.; Blum, N.; Mehlhorn, K.; Paul, M. Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\). (English) Zbl 0714.68036 Inf. Process. Lett. 37, No. 4, 237-240 (1991). MSC: 68Q25 68R10 05C70 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 37, No. 4, 237--240 (1991; Zbl 0714.68036) Full Text: DOI
Ching, Yu-Tai; Mehlhorn, Kurt; Smid, Michiel H. M. Dynamic deferred data structuring. (English) Zbl 0704.68025 Inf. Process. Lett. 35, No. 1, 37-40 (1990). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{Y.-T. Ching} et al., Inf. Process. Lett. 35, No. 1, 37--40 (1990; Zbl 0704.68025) Full Text: DOI
Mehlhorn, Kurt; Näher, Stefan Bounded ordered dictionaries in O(log log N) time and O(n) space. (English) Zbl 0702.68042 Inf. Process. Lett. 35, No. 4, 183-189 (1990). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Näher}, Inf. Process. Lett. 35, No. 4, 183--189 (1990; Zbl 0702.68042) Full Text: DOI
Mehlhorn, K.; Näher, S.; Uhrig, C. Hidden line elimination for isooriented rectangles. (English) Zbl 0697.68045 Inf. Process. Lett. 35, No. 3, 137-143 (1990). MSC: 68Q25 68U99 52A15 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Inf. Process. Lett. 35, No. 3, 137--143 (1990; Zbl 0697.68045) Full Text: DOI DOI
Jung, Hermann; Mehlhorn, Kurt Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. (English) Zbl 0637.68046 Inf. Process. Lett. 27, No. 5, 227-236 (1988). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{H. Jung} and \textit{K. Mehlhorn}, Inf. Process. Lett. 27, No. 5, 227--236 (1988; Zbl 0637.68046) Full Text: DOI
Mehlhorn, Kurt A faster approximation algorithm for the Steiner problem in graphs. (English) Zbl 0635.68071 Inf. Process. Lett. 27, No. 3, 125-128 (1988). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Inf. Process. Lett. 27, No. 3, 125--128 (1988; Zbl 0635.68071) Full Text: DOI
Fries, O.; Mehlhorn, K.; Näher, S.; Tsakalidis, A. A log log n data structure for three-sided range queries. (English) Zbl 0653.68057 Inf. Process. Lett. 25, 269-273 (1987). MSC: 68P10 68Q25 68P05 PDFBibTeX XMLCite \textit{O. Fries} et al., Inf. Process. Lett. 25, 269--273 (1987; Zbl 0653.68057) Full Text: DOI
Alt, Helmut; Mehlhorn, Kurt; Munro, J. Ian Partial match retrieval in implicit data structures. (English) Zbl 0549.68033 Inf. Process. Lett. 19, 61-65 (1984). MSC: 68Q25 68P20 68P05 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 19, 61--65 (1984; Zbl 0549.68033) Full Text: DOI
Becker, M.; Degenhardt, W.; Doenhardt, J.; Hertel, S.; Kaninke, G.; Keber, W.; Mehlhorn, K.; Naeher, S.; Rohnert, H.; Winter, T. A probabilistic algorithm for vertex connectivity of graphs. (English) Zbl 0491.68066 Inf. Process. Lett. 15, 135-136 (1982). MSC: 68R10 05C40 68Q25 90B10 PDFBibTeX XMLCite \textit{M. Becker} et al., Inf. Process. Lett. 15, 135--136 (1982; Zbl 0491.68066) Full Text: DOI
Mehlhorn, Kurt; Overmars, Mark H. Optimal dynamization of decomposable searching problems. (English) Zbl 0463.68056 Inf. Process. Lett. 12, 93-98 (1981). MSC: 68P10 68W99 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. H. Overmars}, Inf. Process. Lett. 12, 93--98 (1981; Zbl 0463.68056) Full Text: DOI
Mehlhorn, Kurt Bracket-languages are recognizable in logarithmic space. (English) Zbl 0352.68089 Inf. Process. Lett. 5, 168-170 (1976). MSC: 68Q45 68Q25 68W99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Inf. Process. Lett. 5, 168--170 (1976; Zbl 0352.68089) Full Text: DOI DOI