McConnell, R. M.; Mehlhorn, K.; Näher, S.; Schweitzer, P. Certifying algorithms. (English) Zbl 1298.68289 Comput. Sci. Rev. 5, No. 2, 119-161 (2011). MSC: 68W01 68-02 PDFBibTeX XMLCite \textit{R. M. McConnell} et al., Comput. Sci. Rev. 5, No. 2, 119--161 (2011; Zbl 1298.68289) Full Text: DOI
Mehlhorn, Kurt; Näher, Stefan LEDA. A platform for combinatorial and geometric computing. 2-part set. Reprint of the 1999 hardback ed. (English) Zbl 1167.68057 Cambridge: Cambridge University Press (ISBN 978-0-521-10941-3/pbk). xvi, 1018 p. (2009). MSC: 68U05 68-01 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Näher}, LEDA. A platform for combinatorial and geometric computing. 2-part set. Reprint of the 1999 hardback ed. Cambridge: Cambridge University Press (2009; Zbl 1167.68057)
Funke, Stefan; Mehlhorn, Kurt; Näher, Stefan Structural filtering: a paradigm for efficient and exact geometric programs. (English) Zbl 1078.65015 Comput. Geom. 31, No. 3, 179-194 (2005). Reviewer: Ivana Linkeová (Praha) MSC: 65D18 68Q25 68P10 PDFBibTeX XMLCite \textit{S. Funke} et al., Comput. Geom. 31, No. 3, 179--194 (2005; Zbl 1078.65015) Full Text: DOI
Mehlhorn, Kurt; Näher, Stefan LEDA. A platform for combinatorial and geometric computing. (English) Zbl 0976.68156 Cambridge: Cambridge University Press. xvi, 1018 p. (1999). MSC: 68U05 68-01 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Näher}, LEDA. A platform for combinatorial and geometric computing. Cambridge: Cambridge University Press (1999; Zbl 0976.68156)
Mehlhorn, Kurt; Näher, Stefan; Seel, Michael; Seidel, Raimund; Schilz, Thomas; Schirra, Stefan; Uhrig, Christian Checking geometric programs or verification of geometric structures. (English) Zbl 0922.68123 Comput. Geom. 12, No. 1-2, 85-103 (1999). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 12, No. 1--2, 85--103 (1999; Zbl 0922.68123) Full Text: DOI
Mehlhorn, K.; Müller, M.; Näher, S.; Schirra, S.; Seel, M.; Uhrig, C.; Ziegler, J. A computational basis for higher-dimensional computational geometry and applications. (English) Zbl 0905.68162 Comput. Geom. 10, No. 4, 289-303 (1998). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 10, No. 4, 289--303 (1998; Zbl 0905.68162) Full Text: DOI
Mehlhorn, Kurt; Näher, Stefan LEDA – a platform for combinatoric and geometric computing. (LEDA – eine Plattform für kombinatorisches und geometrisches Rechnen.) (German) Zbl 1077.68734 Wegener, Ingo (ed.), Highlights aus der Informatik. (Highlights from computer science). Berlin: Springer (ISBN 3-540-60187-2/hbk). 112-129 (1996). MSC: 68R10 68R05 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Näher}, in: Highlights aus der Informatik. Berlin: Springer. 112--129 (1996; Zbl 1077.68734)
Mehlhorn, Kurt (ed.); Näher, Stefan (ed.); Nievergelt, Jurg (ed.) Algorithms: implementation, libraries and use. Special issue, Workshop, August 1993, Schloß Dagstuhl, Germany. Journal of Symbolic Computation 17, No. 4. Journal of Symbolic Computation 17, No. 4. (English) Zbl 0795.00020 London: Academic Press, p. 297-369 (1994). MSC: 00B25 68-06 PDFBibTeX XMLCite \textit{K. Mehlhorn} (ed.) et al., Algorithms: implementation, libraries and use. Special issue, Workshop, August 1993, Schloß Dagstuhl, Germany. Journal of Symbolic Computation 17, No. 4. \newline Journal of Symbolic Computation 17, No. 4. London: Academic Press (1994; Zbl 0795.00020)
Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. (English) Zbl 0760.68082 Algorithmica 8, No. 5-6, 391-406 (1992). Reviewer: N.Korneenko (Bialystok) MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., Algorithmica 8, No. 5--6, 391--406 (1992; Zbl 0760.68082) 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 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
Mehlhorn, Kurt; Näher, Stefan Dynamic fractional cascading. (English) Zbl 0693.68038 Algorithmica 5, No. 2, 215-241 (1990). Reviewer: G.Slutzki MSC: 68P10 68P05 68Q25 68U99 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Näher}, Algorithmica 5, No. 2, 215--241 (1990; Zbl 0693.68038) 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
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
Mehlhorn, K.; Näher, S.; Alt, H. A lower bound for the complexity of the union-split-find problem. (English) Zbl 0635.68033 Automata, languages and programming, Proc. 14th Int. Colloq., Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 267, 479-488 (1987). Reviewer: K.Mehlhorn MSC: 68Q25 68P10 PDFBibTeX XML
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