Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M. Certifying 3-edge-connectivity. (English) Zbl 1356.05150 Algorithmica 77, No. 2, 309-335 (2017). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Algorithmica 77, No. 2, 309--335 (2017; Zbl 1356.05150) Full Text: DOI arXiv
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios Fair matchings and related problems. (English) Zbl 1333.05241 Algorithmica 74, No. 3, 1184-1203 (2016). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., Algorithmica 74, No. 3, 1184--1203 (2016; Zbl 1333.05241) Full Text: DOI Link
Elbassioni, Khaled; Makino, Kazuhisa; Mehlhorn, Kurt; Ramezani, Fahimeh On randomized fictitious play for approximating saddle points over convex sets. (English) Zbl 1330.91012 Algorithmica 73, No. 2, 441-459 (2015). MSC: 91A05 68W20 90C05 90C27 PDFBibTeX XMLCite \textit{K. Elbassioni} et al., Algorithmica 73, No. 2, 441--459 (2015; Zbl 1330.91012) Full Text: DOI arXiv
Christodoulou, Giorgos; Mehlhorn, Kurt; Pyrga, Evangelia Improving the price of anarchy for selfish routing via coordination mechanisms. (English) Zbl 1291.91037 Algorithmica 69, No. 3, 619-640 (2014). MSC: 91A43 91A10 68M20 PDFBibTeX XMLCite \textit{G. Christodoulou} et al., Algorithmica 69, No. 3, 619--640 (2014; Zbl 1291.91037) Full Text: DOI arXiv
Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M. An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs. (English) Zbl 1239.05107 Algorithmica 62, No. 3-4, 754-766 (2012). MSC: 05C40 05C45 05C85 PDFBibTeX XMLCite \textit{A. Elmasry} et al., Algorithmica 62, No. 3--4, 754--766 (2012; Zbl 1239.05107) Full Text: DOI
Halperin, Dan (ed.); Mehlhorn, Kurt (ed.) Special issue: European symposium on algorithms. Selected papers based on the presentations at the 16th annual symposium (ESA 2008), Karlsruhe, Germany, September 15–17, 2008. (English) Zbl 1221.68019 Algorithmica 60, No. 1, 174 p. (2011). MSC: 68-06 00B25 PDFBibTeX XML
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios New approximation algorithms for minimum cycle bases of graphs. (English) Zbl 1215.68185 Algorithmica 59, No. 4, 471-488 (2011). MSC: 68R10 05C38 05C85 68W25 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Algorithmica 59, No. 4, 471--488 (2011; Zbl 1215.68185) Full Text: DOI Link
Garg, Naveen; Kavitha, Telikepalli; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián Assigning papers to referees. (English) Zbl 1203.90092 Algorithmica 58, No. 1, 119-136 (2010). MSC: 90B80 90C47 68Q25 PDFBibTeX XMLCite \textit{N. Garg} et al., Algorithmica 58, No. 1, 119--136 (2010; Zbl 1203.90092) Full Text: DOI
Burnikel, Christoph; Funke, Stefan; Mehlhorn, Kurt; Schirra, Stefan; Schmitt, Susanne A separation bound for real algebraic expressions. (English) Zbl 1180.68304 Algorithmica 55, No. 1, 14-28 (2009). MSC: 68W30 68U05 PDFBibTeX XMLCite \textit{C. Burnikel} et al., Algorithmica 55, No. 1, 14--28 (2009; Zbl 1180.68304) Full Text: DOI
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs. (English) Zbl 1163.68329 Algorithmica 52, No. 3, 333-349 (2008). MSC: 68R10 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Algorithmica 52, No. 3, 333--349 (2008; Zbl 1163.68329) Full Text: DOI
Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao A heuristic for Dijkstra’s algorithm with many targets and its use in weighted matching algorithms. (English) Zbl 1045.68148 Algorithmica 36, No. 1, 75-88 (2003). MSC: 68W05 PDFBibTeX XMLCite \textit{H. Bast} et al., Algorithmica 36, No. 1, 75--88 (2003; Zbl 1045.68148) Full Text: DOI
Mehlhorn, Kurt; Sanders, Peter Scanning multiple sequences via cache memory. (English) Zbl 1026.68157 Algorithmica 35, No. 1, 75-93 (2003). MSC: 68W05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{P. Sanders}, Algorithmica 35, No. 1, 75--93 (2003; Zbl 1026.68157) Full Text: DOI
Burnikel, C.; Fleischer, R.; Mehlhorn, K.; Schirra, S. A strong and easily computable separation bound for arithmetic expressions involving radicals. (English) Zbl 0953.68136 Algorithmica 27, No. 1, 87-99 (2000). MSC: 68U05 68W05 PDFBibTeX XMLCite \textit{C. Burnikel} et al., Algorithmica 27, No. 1, 87--99 (2000; Zbl 0953.68136) Full Text: DOI
Mehlhorn, K.; Sundar, R.; Uhrig, C. Maintaining dynamic sequences under equality tests in polylogarithmic time. (English) Zbl 0865.68034 Algorithmica 17, No. 2, 183-198 (1997). MSC: 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Algorithmica 17, No. 2, 183--198 (1997; Zbl 0865.68034) Full Text: DOI
Alt, H.; Guibas, L.; Mehlhorn, K.; Karp, R.; Wigderson, A. A method for obtaining randomized algorithms with small tail probabilities. (English) Zbl 0857.68057 Algorithmica 16, No. 4-5, 543-547 (1996). MSC: 68W10 PDFBibTeX XMLCite \textit{H. Alt} et al., Algorithmica 16, No. 4--5, 543--547 (1996; Zbl 0857.68057) Full Text: DOI
Mehlhorn, K.; Mutzel, P. On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. (English) Zbl 0854.68075 Algorithmica 16, No. 2, 233-242 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{P. Mutzel}, Algorithmica 16, No. 2, 233--242 (1996; Zbl 0854.68075) Full Text: DOI
Cheriyan, J.; Mehlhorn, K. Algorithms for dense graphs and networks on the random access computer. (English) Zbl 0848.68070 Algorithmica 15, No. 6, 521-549 (1996). MSC: 68R10 68M10 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{K. Mehlhorn}, Algorithmica 15, No. 6, 521--549 (1996; Zbl 0848.68070) Full Text: DOI
Dietz, P.; Mehlhorn, K.; Raman, R.; Uhrig, C. Lower bounds for set intersection queries. (English) Zbl 0833.68037 Algorithmica 14, No. 2, 154-168 (1995). MSC: 68P05 68W10 PDFBibTeX XMLCite \textit{P. Dietz} et al., Algorithmica 14, No. 2, 154--168 (1995; Zbl 0833.68037) Full Text: DOI
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
Fleischer, Rudolf; Mehlhorn, Kurt; Rote, Günter; Welzl, Emo; Yap, Chee Simultaneous inner and outer approximation of shapes. (English) Zbl 0760.68083 Algorithmica 8, No. 5-6, 365-389 (1992). Reviewer: N.Korneenko (Bialystok) MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{R. Fleischer} et al., Algorithmica 8, No. 5--6, 365--389 (1992; Zbl 0760.68083) Full Text: 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; Preparata, F. P.; Sarrafzadeh, M. Channel routing in knock-knee mode: Simplified algorithms and proofs. (English) Zbl 0622.68059 Algorithmica 1, 213-221 (1986). MSC: 68R10 94C15 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Algorithmica 1, 213--221 (1986; Zbl 0622.68059) Full Text: DOI