Facca, Enrico; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt Convergence of the non-uniform directed physarum model. (English) Zbl 1437.90098 Theor. Comput. Sci. 816, 184-194 (2020). Reviewer: Franco Cardin (Padova) MSC: 90C05 92-08 37B25 68Q07 68Q10 90C59 PDFBibTeX XMLCite \textit{E. Facca} et al., Theor. Comput. Sci. 816, 184--194 (2020; Zbl 1437.90098) Full Text: DOI arXiv
Becker, Ruben; Bonifaci, Vincenzo; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt Two results on slime mold computations. (English) Zbl 1422.68068 Theor. Comput. Sci. 773, 79-106 (2019). MSC: 68Q05 68W25 68W40 90C05 92D50 PDFBibTeX XMLCite \textit{R. Becker} et al., Theor. Comput. Sci. 773, 79--106 (2019; Zbl 1422.68068) Full Text: DOI arXiv
Duan, Ran; Garg, Jugal; Mehlhorn, Kurt An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market. (English) Zbl 1417.91326 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 90-106 (2016). MSC: 91B50 90C27 PDFBibTeX XMLCite \textit{R. Duan} et al., in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 90--106 (2016; Zbl 1417.91326) Full Text: DOI arXiv
Elbassioni, Khaled; Mehlhorn, Kurt; Ramezani, Fahimeh Towards more practical linear programming-based techniques for algorithmic mechanism design. (English) Zbl 1356.91050 Theory Comput. Syst. 59, No. 4, 641-663 (2016). MSC: 91B26 90C10 68W25 PDFBibTeX XMLCite \textit{K. Elbassioni} et al., Theory Comput. Syst. 59, No. 4, 641--663 (2016; Zbl 1356.91050) Full Text: DOI arXiv
Mehlhorn, Kurt; Saxena, Sanjeev A still simpler way of introducing interior-point method for linear programming. (English) Zbl 1398.90204 Comput. Sci. Rev. 22, 1-11 (2016). MSC: 90C51 90-01 97N60 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Saxena}, Comput. Sci. Rev. 22, 1--11 (2016; Zbl 1398.90204) 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
Elbassioni, Khaled; Mehlhorn, Kurt; Ramezani, Fahimeh Towards more practical linear programming-based techniques for algorithmic mechanism design. (English) Zbl 1358.91058 Hoefer, Martin (ed.), Algorithmic game theory. 8th international symposium, SAGT 2015, Saarbrücken, Germany, September 28–30, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48432-6/pbk; 978-3-662-48433-3/pbk). Lecture Notes in Computer Science 9347, 98-109 (2015). MSC: 91B26 90C05 90C59 PDFBibTeX XMLCite \textit{K. Elbassioni} et al., Lect. Notes Comput. Sci. 9347, 98--109 (2015; Zbl 1358.91058) 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
Bhattacharya, Sayan; Chalermsook, Parinya; Mehlhorn, Kurt; Neumann, Adrian New approximability results for the robust \(k\)-median problem. (English) Zbl 1417.68049 Ravi, R. (ed.) et al., Algorithm theory – SWAT 2014. 14th Scandinavian symposium and workshops, Copenhagen, Denmark, July 2–4, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8503, 50-61 (2014). MSC: 68Q17 90B80 PDFBibTeX XMLCite \textit{S. Bhattacharya} et al., Lect. Notes Comput. Sci. 8503, 50--61 (2014; Zbl 1417.68049) Full Text: DOI arXiv
Dietzfelbinger, Martin; Mehlhorn, Kurt; Sanders, Peter Algorithms and data structures. Basic toolbox. (Algorithmen und Datenstrukturen. Die Grundwerkzeuge.) (German) Zbl 1301.68002 eXamen.press. Wiesbaden: Springer Vieweg (ISBN 978-3-642-05471-6/pbk; 978-3-642-05472-3/ebook). xii, 380 p. (2014). Reviewer: Dieter Riebesehl (Lüneburg) MSC: 68-01 68W05 68P05 68P10 68R10 68W40 90C05 90C59 PDFBibTeX XMLCite \textit{M. Dietzfelbinger} et al., Algorithmen und Datenstrukturen. Die Grundwerkzeuge. Wiesbaden: Springer Vieweg (2014; Zbl 1301.68002) Full Text: DOI
Becchetti, Luca; Bonifaci, Vincenzo; Dirnberger, Michael; Karrenbauer, Andreas; Mehlhorn, Kurt Physarum can compute shortest paths: convergence proofs and complexity bounds. (English) Zbl 1335.68099 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). Lecture Notes in Computer Science 7966, 472-483 (2013). MSC: 68Q25 05C85 90C35 90C59 92D50 PDFBibTeX XMLCite \textit{L. Becchetti} et al., Lect. Notes Comput. Sci. 7966, 472--483 (2013; Zbl 1335.68099) Full Text: DOI
Manlove, David F. [Mehlhorn, Kurt] Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. (English) Zbl 1283.68018 Series on Theoretical Computer Science 2. Hackensack, NJ: World Scientific (ISBN 978-981-4425-24-7/hbk; 978-981-4425-26-1/ebook). xxxi, 491 p. (2013). Reviewer: Vladimír Lacko (Košice) MSC: 68-02 68Wxx 05C70 91B68 90C35 PDFBibTeX XMLCite \textit{D. F. Manlove}, Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. Hackensack, NJ: World Scientific (2013; Zbl 1283.68018) Full Text: DOI
Elbassioni, Khaled; Makino, Kazuhisa; Mehlhorn, Kurt; Ramezani, Fahimeh On randomized fictitious play for approximating saddle points over convex sets. (English) Zbl 1382.91007 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 65-76 (2013). MSC: 91A05 68W20 90C05 90C27 PDFBibTeX XMLCite \textit{K. Elbassioni} et al., Lect. Notes Comput. Sci. 7936, 65--76 (2013; Zbl 1382.91007) Full Text: DOI arXiv
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
Mehlhorn, Kurt Matchings in graphs. Variations of the problem. (English) Zbl 1175.90336 Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 1-2 (2007). MSC: 90C27 05C70 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 4616, 1--2 (2007; Zbl 1175.90336) Full Text: DOI Link
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. Rank-maximal matchings. (English) Zbl 1321.90116 ACM Trans. Algorithms 2, No. 4, 602-610 (2006). MSC: 90C27 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{R. W. Irving} et al., ACM Trans. Algorithms 2, No. 4, 602--610 (2006; Zbl 1321.90116) Full Text: DOI
Abraham, David J.; Cechlárová, Katarína; Manlove, David F.; Mehlhorn, Kurt Pareto optimality in house allocation problems. (English) Zbl 1115.90049 Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 1163-1175 (2005). MSC: 90C29 91A12 91B32 PDFBibTeX XMLCite \textit{D. J. Abraham} et al., Lect. Notes Comput. Sci. 3827, 1163--1175 (2005; Zbl 1115.90049) Full Text: DOI
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna Rank-maximal matchings. (English) Zbl 1318.90060 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 68-75 (2004). MSC: 90C27 05C70 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{R. W. Irving} et al., in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 68--75 (2004; Zbl 1318.90060)
Abraham, David J.; Cechlárová, Katarína; Manlove, David F.; Mehlhorn, Kurt Pareto optimality in house allocation problems. (English) Zbl 1116.90393 Fleischer, Rudolf (ed.) et al., Algorithms and computation. 15th international symposium, ISAAC 2004, Hong Kong, China, December 20–22, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24131-0/pbk). Lecture Notes in Computer Science 3341, 3-15 (2004). MSC: 90C29 91A12 91B32 PDFBibTeX XMLCite \textit{D. J. Abraham} et al., Lect. Notes Comput. Sci. 3341, 3--15 (2004; Zbl 1116.90393) Full Text: DOI
Dhiflaoui, Marcel; Funke, Stefan; Kwappik, Carsten; Mehlhorn, Kurt; Seel, Michael; Schömer, Elmar; Schulte, Ralph; Weber, Dennis Certifying and repairing solutions to large LPs: How good are LP-solvers? (English) Zbl 1176.90395 Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 255-256 (2003). MSC: 90C05 90C06 PDFBibTeX XMLCite \textit{M. Dhiflaoui} et al., in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2003, Baltimore, MD, USA, January 12--14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 255--256 (2003; Zbl 1176.90395)
Althaus, Ernst; Bockmayr, Alexander; Elf, Matthias; Jünger, Michael; Kasper, Thomas; Mehlhorn, Kurt SCIL – symbolic constraints in integer linear programming. (English) Zbl 1019.90515 Möhring, Rolf (ed.) et al., Algorithms - ESA 2002. 10th annual European symposium, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2461, 75-87 (2002). MSC: 90C10 90-04 90C27 90C35 68W30 PDFBibTeX XMLCite \textit{E. Althaus} et al., Lect. Notes Comput. Sci. 2461, 75--87 (2002; Zbl 1019.90515) Full Text: Link
Mehlhorn, K.; Ziegelmann, M. CNOP - A package for constrained network optimization. (English) Zbl 1010.68718 Buchsbaum, Adam L. (ed.) et al., Algorithm engineering and experimentation. 3rd international workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2153, 17-31 (2001). MSC: 68U99 68W05 90C27 90C35 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. Ziegelmann}, Lect. Notes Comput. Sci. 2153, 17--31 (2001; Zbl 1010.68718) Full Text: Link
Mehlhorn, Kurt; Ziegelmann, Mark Resource constrained shortest paths. (English) Zbl 0974.68215 Paterson, Mike (ed.), Algorithms - ESA 2000. 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1879, 326-337 (2000). MSC: 68U05 68Q25 90C05 68W25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. Ziegelmann}, Lect. Notes Comput. Sci. 1879, 326--337 (2000; Zbl 0974.68215)
Kececioglu, John D.; Lenhof, Hans-Peter; Mehlhorn, Kurt; Mutzel, Petra; Reinert, Knut; Vingron, Martin A polyhedral approach to sequence alignment problems. (English) Zbl 0998.92017 Discrete Appl. Math. 104, No. 1-3, 143-186 (2000). MSC: 92C40 05C90 92D20 90C27 65Y20 PDFBibTeX XMLCite \textit{J. D. Kececioglu} et al., Discrete Appl. Math. 104, No. 1--3, 143--186 (2000; Zbl 0998.92017) Full Text: DOI
Althaus, Ernst; Mehlhorn, Kurt TSP-based curve reconstruction in polynomial time. (English) Zbl 0954.65011 Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 686-695 (2000). MSC: 65D17 65K05 90C35 90C27 PDFBibTeX XMLCite \textit{E. Althaus} and \textit{K. Mehlhorn}, in: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms, SODA 2000, San Francisco, CA, USA, January 9--11, 2000. Philadelphia, PA: SIAM. 686--695 (2000; Zbl 0954.65011)
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
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
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
Kaufmann, Michael; Mehlhorn, Kurt On local routing of two-terminal nets. (English) Zbl 0810.05063 J. Comb. Theory, Ser. B 55, No. 1, 33-72 (1992). MSC: 05C85 05C38 90C35 68R10 PDFBibTeX XMLCite \textit{M. Kaufmann} and \textit{K. Mehlhorn}, J. Comb. Theory, Ser. B 55, No. 1, 33--72 (1992; Zbl 0810.05063) Full Text: DOI
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt Can a maximum flow be computed in \(o(nm)\) time? (English) Zbl 0768.90020 Automata, languages and programming, Proc. 17th Int. Colloq., Warwick/GB 1990, Lect. Notes Comput. Sci. 443, 235-248 (1990). MSC: 90B10 68Q25 90C60 65Y05 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., Lect. Notes Comput. Sci. 443, 235--248 (1990; Zbl 0768.90020)
Mehlhorn, Kurt; Schmidt, Bernd H. On BF-orderable graphs. (English) Zbl 0605.05025 Discrete Appl. Math. 15, 315-327 (1986). Reviewer: F.Plastria MSC: 05C38 90C35 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{B. H. Schmidt}, Discrete Appl. Math. 15, 315--327 (1986; Zbl 0605.05025) Full Text: DOI
Mehlhorn, K.; Schmidt, B. H. A single source shortest path algorithm for graphs with separators. (English) Zbl 0521.68036 Foundations of computation theory, Proc. int. FCT-Conf., Borgholm/ Swed. 1983, Lect. Notes Comput. Sci. 158, 302-309 (1983). MSC: 68Q25 90C35 05C38 05C35 68R10 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