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
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
Kolev, Pavel; Mehlhorn, Kurt A note on spectral clustering. (English) Zbl 1397.68144 Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 57, 14 p. (2016). MSC: 68R10 05C50 05C70 05C85 68W20 PDFBibTeX XMLCite \textit{P. Kolev} and \textit{K. Mehlhorn}, LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 57, 14 p. (2016; Zbl 1397.68144) Full Text: DOI
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
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios Fair matchings and related problems. (English) Zbl 1359.05101 Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 339-350 (2013). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 339--350 (2013; Zbl 1359.05101) Full Text: DOI
Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M. Certifying 3-edge-connectivity. (English) Zbl 1417.05226 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 39th international workshop, WG 2013, Lübeck, Germany, June 19–21, 2013. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 8165, 358-369 (2013). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Lect. Notes Comput. Sci. 8165, 358--369 (2013; Zbl 1417.05226) Full Text: DOI arXiv
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt The query complexity of finding a hidden permutation. (English) Zbl 1391.68044 Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 1-11 (2013). MSC: 68Q25 05A05 PDFBibTeX XMLCite \textit{P. Afshani} et al., Lect. Notes Comput. Sci. 8066, 1--11 (2013; Zbl 1391.68044) Full Text: DOI Link
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
Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M. Every DFS tree of a 3-connected graph contains a contractible edge. (English) Zbl 1259.05097 J. Graph Theory 72, No. 1-2, 112-121 (2013). MSC: 05C40 05C05 PDFBibTeX XMLCite \textit{A. Elmasry} et al., J. Graph Theory 72, No. 1--2, 112--121 (2013; Zbl 1259.05097) Full Text: DOI
Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish Physarum can compute shortest paths. (English) Zbl 1411.92332 J. Theor. Biol. 309, 121-133 (2012). MSC: 92D50 05C85 PDFBibTeX XMLCite \textit{V. Bonifaci} et al., J. Theor. Biol. 309, 121--133 (2012; Zbl 1411.92332) Full Text: DOI
Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish Physarum can compute shortest paths. (English) Zbl 1420.68088 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 233-240 (2012). MSC: 68Q05 05C85 92D50 PDFBibTeX XMLCite \textit{V. Bonifaci} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 233--240 (2012; Zbl 1420.68088) Full Text: Link
Megow, Nicole; Mehlhorn, Kurt; Schweitzer, Pascal Online graph exploration: New results on old and new algorithms. (English) Zbl 1269.05103 Theor. Comput. Sci. 463, 62-72 (2012). MSC: 05C85 PDFBibTeX XMLCite \textit{N. Megow} et al., Theor. Comput. Sci. 463, 62--72 (2012; Zbl 1269.05103) Full Text: DOI
Kane, Daniel M.; Mehlhorn, Kurt; Sauerwald, Thomas; Sun, He Counting arbitrary subgraphs in data streams. (English) Zbl 1367.68213 Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 598-609 (2012). MSC: 68R10 05C60 05C85 68W40 PDFBibTeX XMLCite \textit{D. M. Kane} et al., Lect. Notes Comput. Sci. 7392, 598--609 (2012; Zbl 1367.68213) Full Text: DOI
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
Shervashidze, Nino; Schweitzer, Pascal; van Leeuwen, Erik Jan; Mehlhorn, Kurt; Borgwardt, Karsten M. Weisfeiler-Lehman graph kernels. (English) Zbl 1280.68194 J. Mach. Learn. Res. 12, 2539-2561 (2011). MSC: 68T05 62H30 05C90 PDFBibTeX XMLCite \textit{N. Shervashidze} et al., J. Mach. Learn. Res. 12, 2539--2561 (2011; Zbl 1280.68194) Full Text: Link
Manjunath, Madhusudan; Mehlhorn, Kurt; Panagiotou, Konstantinos; Sun, He Approximate counting of cycles in streams. (English) Zbl 1346.68257 Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 677-688 (2011). MSC: 68W25 05C30 05C38 05C85 68Q87 PDFBibTeX XMLCite \textit{M. Manjunath} et al., Lect. Notes Comput. Sci. 6942, 677--688 (2011; Zbl 1346.68257) Full Text: DOI
Megow, Nicole; Mehlhorn, Kurt; Schweitzer, Pascal Online graph exploration: new results on old and new algorithms. (English) Zbl 1334.68306 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 478-489 (2011). MSC: 68W27 05C85 68R10 68T20 PDFBibTeX XMLCite \textit{N. Megow} et al., Lect. Notes Comput. Sci. 6756, 478--489 (2011; Zbl 1334.68306) Full Text: DOI
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
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth Additive spanners and \(({\alpha}, {\beta})\)-spanners. (English) Zbl 1295.05094 ACM Trans. Algorithms 7, No. 1, Article No. 5, 26 p. (2010). MSC: 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Baswana} et al., ACM Trans. Algorithms 7, No. 1, Article No. 5, 26 p. (2010; Zbl 1295.05094) Full Text: DOI
Mehlhorn, Kurt; Michail, Dimitrios Minimum cycle bases, faster and simpler. (English) Zbl 1300.05304 ACM Trans. Algorithms 6, No. 1, Article No. 8, 13 p. (2009). MSC: 05C85 05C38 68W25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{D. Michail}, ACM Trans. Algorithms 6, No. 1, Article No. 8, 13 p. (2009; Zbl 1300.05304) Full Text: DOI
Kavitha, Telikepalli; Liebchen, Christian; Mehlhorn, Kurt; Michail, Dimitrios; Rizzi, Romeo; Ueckerdt, Torsten; Zweig, Katharina A. Cycle bases in graphs characterization, algorithms, complexity, and applications. (English) Zbl 1301.05195 Comput. Sci. Rev. 3, No. 4, 199-243 (2009). MSC: 05C38 05C10 05C85 68R10 68W25 68Q25 05C90 05-02 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Comput. Sci. Rev. 3, No. 4, 199--243 (2009; Zbl 1301.05195) Full Text: DOI Link
Amaldi, Edoardo; Iuliano, Claudio; Jurkiewicz, Tomasz; Mehlhorn, Kurt; Rizzi, Romeo Breaking the \(O(m ^{2} n)\) barrier for minimum cycle bases. (English) Zbl 1256.68080 Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 301-312 (2009). MSC: 68Q25 05C38 68R10 PDFBibTeX XMLCite \textit{E. Amaldi} et al., Lect. Notes Comput. Sci. 5757, 301--312 (2009; Zbl 1256.68080) Full Text: DOI
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
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. (English) Zbl 1321.05207 ACM Trans. Algorithms 3, No. 2, Article No. 15, 18 p. (2007). MSC: 05C70 05C85 68Q25 91B68 PDFBibTeX XMLCite \textit{T. Kavitha} et al., ACM Trans. Algorithms 3, No. 2, Article No. 15, 18 p. (2007; Zbl 1321.05207) 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
Mehlhorn, Kurt Minimum cycle bases in graphs. Algorithms and applications. (English) Zbl 1147.68610 Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 13-14 (2007). MSC: 68R10 05C38 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 4708, 13--14 (2007; Zbl 1147.68610) 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
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios New approximation algorithms for minimum cycle bases of graphs. (English) Zbl 1186.68561 Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 512-523 (2007). MSC: 68W25 05C38 05C85 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Lect. Notes Comput. Sci. 4393, 512--523 (2007; Zbl 1186.68561) Full Text: DOI Link
Kavitha, Telikepalli; Mehlhorn, Kurt Algorithms to compute minimum cycle basis in directed graphs. (English) Zbl 1121.68087 Theory Comput. Syst. 40, No. 4, 485-505 (2007). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{T. Kavitha} and \textit{K. Mehlhorn}, Theory Comput. Syst. 40, No. 4, 485--505 (2007; Zbl 1121.68087) Full Text: DOI
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
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt A faster deterministic algorithm for minimum cycle bases in directed graphs. (English) Zbl 1223.05298 Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 250-261 (2006). MSC: 05C85 05C20 05C38 68W05 68W20 PDFBibTeX XMLCite \textit{R. Hariharan} et al., Lect. Notes Comput. Sci. 4051, 250--261 (2006; Zbl 1223.05298) Full Text: DOI
Mehlhorn, Kurt; Michail, Dimitrios Implementing minimum cycle basis algorithms. (English) Zbl 1143.05310 ACM J. Exp. Algorithm. 11, Spec. Iss., Article 2.5, 14 p. (2006). MSC: 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{D. Michail}, ACM J. Exp. Algorithm. 11, Article 2.5, 14 p. (2006; Zbl 1143.05310)
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
Bast, Holger; Mehlhorn, Kurt; Schafer, Guido; Tamaki, Hisao Matching algorithms are fast in sparse random graphs. (English) Zbl 1104.68078 Theory Comput. Syst. 39, No. 1, 3-14 (2006). MSC: 68R10 05C70 05C80 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{H. Bast} et al., Theory Comput. Syst. 39, No. 1, 3--14 (2006; Zbl 1104.68078) Full Text: DOI Link
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. (English) Zbl 1297.05066 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 672-681 (2005). MSC: 05C12 05C85 68R10 PDFBibTeX XMLCite \textit{S. Baswana} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 672--681 (2005; Zbl 1297.05066)
Kavitha, Telikepalli; Mehlhorn, Kurt A polynomial time algorithm for minimum cycle basis in directed graphs. (English) Zbl 1118.05314 Diekert, Volker (ed.) et al., STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24998-2/pbk). Lecture Notes in Computer Science 3404, 654-665 (2005). MSC: 05C85 68Q25 68W20 PDFBibTeX XMLCite \textit{T. Kavitha} and \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 3404, 654--665 (2005; Zbl 1118.05314) Full Text: DOI
Mehlhorn, Kurt; Michail, Dimitrios Implementing minimum cycle basis algorithms. (English) Zbl 1121.05314 Nikoletseas, Sotiris E. (ed.), Experimental and efficient algorithms. 4th international workshop, WEA 2005, Santorini Island, Greece, May 10–13, 2005. Proceedings. Berlin Springer (ISBN 3-540-25920-1/pbk). Lecture Notes in Computer Science 3503, 32-43 (2005). MSC: 05C85 05C38 05C80 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{D. Michail}, Lect. Notes Comput. Sci. 3503, 32--43 (2005; Zbl 1121.05314) 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)
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. (English) Zbl 1122.68459 Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 222-233 (2004). MSC: 68Q25 05C70 91B68 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Lect. Notes Comput. Sci. 2996, 222--233 (2004; Zbl 1122.68459) Full Text: DOI
Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao Matching algorithms are fast in sparse random graphs. (English) Zbl 1122.68747 Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 81-92 (2004). MSC: 68W40 05C85 PDFBibTeX XMLCite \textit{H. Bast} et al., Lect. Notes Comput. Sci. 2996, 81--92 (2004; Zbl 1122.68747) Full Text: DOI
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna A faster algorithm for minimum cycle basis of graphs. (English) Zbl 1103.05086 Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 846-857 (2004). MSC: 05C85 05C38 68R10 68W40 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Lect. Notes Comput. Sci. 3142, 846--857 (2004; Zbl 1103.05086) Full Text: DOI
Mehlhorn, Kurt; Schäfer, Guido Implementation of \(O(nm\log n)\) weighted matchings in general graphs: the power of data structures. (English) Zbl 1083.68650 ACM J. Exp. Algorithm. 7, Spec. Iss., Article 4, 19 p. (2002). MSC: 68W40 05C85 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{G. Schäfer}, ACM J. Exp. Algorithm. 7, Article 4, 19 p. (2002; Zbl 1083.68650) Full Text: DOI Link
Mehlhorn, Kurt; Meyer, Ulrich External-memory breadth-first search with sublinear I/O. (English) Zbl 1019.68595 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, 723-735 (2002). MSC: 68R10 68T20 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{U. Meyer}, Lect. Notes Comput. Sci. 2461, 723--735 (2002; Zbl 1019.68595) Full Text: Link
Mehlhorn, Kurt; Meiser, Stefan; Rasch, Ronald Furthest site abstract Voronoi diagrams. (English) Zbl 1074.68643 Int. J. Comput. Geom. Appl. 11, No. 6, 583-616 (2001). MSC: 68U05 05C85 65D18 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Int. J. Comput. Geom. Appl. 11, No. 6, 583--616 (2001; Zbl 1074.68643) Full Text: DOI
Althaus, Ernst; Duchier, Denys; Koller, Alexander; Mehlhorn, Kurt; Niehren, Joachim; Thiel, Sven An efficient algorithm for the configuration problem of dominance graphs. (English) Zbl 0988.68139 Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 815-824 (2001). MSC: 68R10 05C99 PDFBibTeX XMLCite \textit{E. Althaus} et al., in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 815--824 (2001; Zbl 0988.68139)
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
Mehlhorn, Kurt Constraint programming and graph algorithms. (English) Zbl 0973.68252 Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 571-575 (2000). MSC: 68U99 68N19 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 1853, 571--575 (2000; Zbl 0973.68252)
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
Cooper, Colin; Frieze, Alan; Mehlhorn, Kurt; Priebe, Volker Average-case complexity of shortest-paths problems in the vertex-potential model. (English) Zbl 0951.68109 Random Struct. Algorithms 16, No. 1, 33-46 (2000). Reviewer: N.F.Quimpo (Manila) MSC: 68R10 05C38 PDFBibTeX XMLCite \textit{C. Cooper} et al., Random Struct. Algorithms 16, No. 1, 33--46 (2000; Zbl 0951.68109) 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
Arya, Sunil; Golin, Mordecai J.; Mehlhorn, Kurt On the expected depth of random circuits. (English) Zbl 0941.68001 Comb. Probab. Comput. 8, No. 3, 209-228 (1999). MSC: 68M07 05C05 05C80 PDFBibTeX XMLCite \textit{S. Arya} et al., Comb. Probab. Comput. 8, No. 3, 209--228 (1999; Zbl 0941.68001) Full Text: DOI
Crauser, A.; Mehlhorn, K.; Meyer, U.; Sanders, P. A parallelization of Dijkstra’s shortest path algorithm. (English) Zbl 0912.05056 Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 722-731 (1998). Reviewer: A.Kapralski (Kraków) MSC: 05C85 05C80 68R10 PDFBibTeX XMLCite \textit{A. Crauser} et al., Lect. Notes Comput. Sci. 1450, 722--731 (1998; Zbl 0912.05056)
Mehlhorn, Kurt; Priebe, Volker On the all-pairs shortest-path algorithm of Moffat and Takaoka. (English) Zbl 0867.68058 Random Struct. Algorithms 10, No. 1-2, 205-220 (1997). MSC: 68R10 05C38 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{V. Priebe}, Random Struct. Algorithms 10, No. 1--2, 205--220 (1997; Zbl 0867.68058) Full Text: DOI
Mehlhorn, Kurt; Priebe, Volker On the all-pairs shortest path algorithm of Moffat and Takaoka. (English) Zbl 1512.68242 Spirakis, Paul (ed.), Algorithms – ESA ’95. 3rd annual European symposium, Corfu, Greece, September 25–27, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 979, 185-198 (1995). MSC: 68R10 05C38 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{V. Priebe}, Lect. Notes Comput. Sci. 979, 185--198 (1995; Zbl 1512.68242) Full Text: DOI
Kučera, L.; Mehlhorn, K.; Preis, B.; Schwarzenecker, E. Exact algorithms for a geometric packing problem. (Extended abstract). (English) Zbl 0799.68193 Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 317-322 (1993). MSC: 68U05 68Q25 05B40 PDFBibTeX XMLCite \textit{L. Kučera} et al., Lect. Notes Comput. Sci. 665, 317--322 (1993; Zbl 0799.68193)
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
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
Kaufmann, Michael; Mehlhorn, Kurt Routing problems in grid graphs. (English) Zbl 0722.68087 Paths, flows, and VLSI-layout, Proc. Meet., Bonn/Ger. 1988, Algorithms Comb. 9, 165-184 (1990). MSC: 68R10 05C85 05C38 94C99 PDFBibTeX XML
Mehlhorn, Kurt; Yap, Chee-Keng Constructive Hopf’s theorem: Or how to untangle closed planar curves. (English) Zbl 0661.05024 Automata, languages and programming, Proc. 15th Int. Colloq., Tampere/Finn. 1988, Lect. Notes Comput. Sci. 317 (1988), 410-423 (1988). Reviewer: M.Kratko MSC: 05C10 68Q25 51E99 PDFBibTeX XML
Mehlhorn, K.; Rülling, W. Compaction on the torus. (English) Zbl 0656.68044 VLSI algorithms and architectures, Proc. 3rd Aegean Workshop Comput., Corfu/Greece 1988, Lect. Notes Comput. Sci. 319, 212-225 (1988). Reviewer: W.Rülling MSC: 68Q25 68Q80 05B45 PDFBibTeX XML
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
Becker, M.; Mehlhorn, K. Algorithms for routing in planar graphs. (English) Zbl 0591.68065 Acta Inf. 23, 163-176 (1986). MSC: 68R10 68Q25 05C10 PDFBibTeX XMLCite \textit{M. Becker} and \textit{K. Mehlhorn}, Acta Inf. 23, 163--176 (1986; Zbl 0591.68065) Full Text: DOI
Kaufmann, Michael; Mehlhorn, Kurt Routing through a generalized switchbox. (English) Zbl 0582.94028 Automata, languages and programming, 12th Colloq., Nafplion/Greece 1985, Lect. Notes Comput. Sci. 194, 328-337 (1985). Reviewer: E.Ciurea MSC: 94C15 05C38 PDFBibTeX XML
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
Eisenbarth, Bernhard; Ziviani, Nivio; Gonnet, Gaston H.; Mehlhorn, Kurt; Wood, Derick The theory of fringe analysis and its application to 2-3 trees and B- trees. (English) Zbl 0561.68050 Inf. Control 55, 125-174 (1982). Reviewer: R.Janicki MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{B. Eisenbarth} et al., Inf. Control 55, 125--174 (1982; Zbl 0561.68050) 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
Hong, Jia-Wei; Mehlhorn, Kurt; Rosenberg, Arnold L. Cost tradeoffs in graph embeddings, with applications. (English) Zbl 0491.68042 Automata, languages and programming, 8th Colloq., Acre (Akko)/Isr. 1981, Lect. Notes Comput. Sci. 115, 41-55 (1981). MSC: 68Q25 68R10 05C05 05C10 PDFBibTeX XML
Blum, Norbert; Mehlhorn, Kurt Average number of rebalancing operations in weight-balanced trees. (Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.) (German) Zbl 0399.05022 Theor. Comput. Sci., 4th GI Conf., Aachen, 1979. Lect. Notes Comput. Sci. 67, 67-78 (1979). MSC: 05C05 68R10 PDFBibTeX XML
Mehlhorn, Kurt On digital tree searching. (English) Zbl 0383.68055 Arbres en Algebre et Program., 3eme Coll. Lille 1978, 233-236 (1978). MSC: 68R99 05C05 68R10 68Q25 PDFBibTeX XML
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
Mehlhorn, Kurt Nearly optimal binary search trees. (English) Zbl 0333.68028 Acta Inf. 5, 287-295 (1975). MSC: 68W99 68N01 68P20 68Q25 05C05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Acta Inf. 5, 287--295 (1975; Zbl 0333.68028) Full Text: DOI