Kavitha, Telikepalli (ed.); Mehlhorn, Kurt (ed.) 6th SIAM symposium on simplicity in algorithms, SOSA 2023, co-located with SODA 2023, Florence, Italy, January 23–25, 2023. (English) Zbl 1508.68018 Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-758-5/ebook). vi, 389 p. (2023). MSC: 68-06 68Wxx 00B25 PDFBibTeX XMLCite \textit{T. Kavitha} (ed.) and \textit{K. Mehlhorn} (ed.), 6th SIAM symposium on simplicity in algorithms, SOSA 2023, co-located with SODA 2023, Florence, Italy, January 23--25, 2023. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (2023; Zbl 1508.68018) Full Text: DOI
Chaudhury, Bhaskar Ray; Cheung, Yun Kuen; Garg, Jugal; Garg, Naveen; Hoefer, Martin; Mehlhorn, Kurt Fair division of indivisible goods for a class of concave valuations. (English) Zbl 07565984 J. Artif. Intell. Res. (JAIR) 74, 111-142 (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., J. Artif. Intell. Res. (JAIR) 74, 111--142 (2022; Zbl 07565984) Full Text: DOI
Bonifaci, Vincenzo; Facca, Enrico; Folz, Frederic; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt; Morigi, Giovanna; Shahkarami, Golnoosh; Vermande, Quentin Physarum-inspired multi-commodity flow dynamics. (English) Zbl 07527761 Theor. Comput. Sci. 920, 1-20 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{V. Bonifaci} et al., Theor. Comput. Sci. 920, 1--20 (2022; Zbl 07527761) Full Text: DOI arXiv
Halperin, Dan; Har-Peled, Sariel; Mehlhorn, Kurt; Oh, Eunjin; Sharir, Micha The maximum-level vertex in an arrangement of lines. (English) Zbl 1485.52019 Discrete Comput. Geom. 67, No. 2, 439-461 (2022). MSC: 52C30 52C45 68R05 68W05 68W40 PDFBibTeX XMLCite \textit{D. Halperin} et al., Discrete Comput. Geom. 67, No. 2, 439--461 (2022; Zbl 1485.52019) Full Text: DOI arXiv
Avin, Chen; Schmid, Stefan [Mehlhorn, Kurt] Know the person behind the papers. Today: Kurt Mehlhorn. (English) Zbl 1484.01018 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 135, 22-26 (2021). MSC: 01A70 PDFBibTeX XMLCite \textit{C. Avin} and \textit{S. Schmid}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 135, 22--26 (2021; Zbl 1484.01018) Full Text: Link
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini A little charity guarantees almost envy-freeness. (English) Zbl 1525.91102 SIAM J. Comput. 50, No. 4, 1336-1358 (2021). MSC: 91B32 PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., SIAM J. Comput. 50, No. 4, 1336--1358 (2021; Zbl 1525.91102) Full Text: DOI arXiv
Gao, Yuan; Kamkari, Hamidreza; Karrenbauer, Andreas; Mehlhorn, Kurt; Sharifi, Mohammadamin Physarum Inspired Dynamics to Solve Semi-Definite Programs. arXiv:2111.02291 Preprint, arXiv:2111.02291 [cs.DS] (2021). BibTeX Cite \textit{Y. Gao} et al., ``Physarum Inspired Dynamics to Solve Semi-Definite Programs'', Preprint, arXiv:2111.02291 [cs.DS] (2021) Full Text: arXiv OA License
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini A little charity guarantees almost envy-freeness. (English) Zbl 07304186 Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2658-2672 (2020). MSC: 91B32 PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., in: Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5--8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2658--2672 (2020; Zbl 07304186) Full Text: DOI
Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt Convergence of the non-uniform physarum dynamics. (English) Zbl 1432.68147 Theor. Comput. Sci. 816, 260-269 (2020). MSC: 68Q07 PDFBibTeX XMLCite \textit{A. Karrenbauer} et al., Theor. Comput. Sci. 816, 260--269 (2020; Zbl 1432.68147) Full Text: DOI arXiv
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
Abdulaziz, Mohammad; Mehlhorn, Kurt; Nipkow, Tobias Trustworthy graph algorithms (Invited Talk). (English) Zbl 07561645 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 1, 22 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Abdulaziz} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 1, 22 p. (2019; Zbl 07561645) Full Text: DOI arXiv
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
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman Sequential and parallel algorithms and data structures. The basic toolbox. (English) Zbl 1445.68003 Cham: Springer (ISBN 978-3-030-25208-3/hbk; 978-3-030-25209-0/ebook). xv, 509 p. (2019). Reviewer: Irina Ioana Mohorianu (Oxford) MSC: 68-01 68P05 68P10 68Wxx PDFBibTeX XMLCite \textit{P. Sanders} et al., Sequential and parallel algorithms and data structures. The basic toolbox. Cham: Springer (2019; Zbl 1445.68003) Full Text: DOI
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
Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt The query complexity of a permutation-based variant of mastermind. (English) Zbl 1411.91153 Discrete Appl. Math. 260, 28-50 (2019). MSC: 91A46 68Q25 91-04 PDFBibTeX XMLCite \textit{P. Afshani} et al., Discrete Appl. Math. 260, 28--50 (2019; Zbl 1411.91153) Full Text: DOI arXiv
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Multi-finger binary search trees. (English) Zbl 07561409 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 55, 26 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{P. Chalermsook} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 55, 26 p. (2018; Zbl 07561409) Full Text: DOI arXiv
Chaudhury, Bhaskar Ray; Mehlhorn, Kurt Combinatorial algorithms for general linear Arrow-Debreu markets. (English) Zbl 1528.91036 Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 26, 16 p. (2018). MSC: 91B26 68Q25 91B52 PDFBibTeX XMLCite \textit{B. R. Chaudhury} and \textit{K. Mehlhorn}, LIPIcs -- Leibniz Int. Proc. Inform. 122, Article 26, 16 p. (2018; Zbl 1528.91036) Full Text: DOI arXiv
Chaudhury, Bhaskar Ray; Cheung, Yun Kuen; Garg, Jugal; Garg, Naveen; Hoefer, Martin; Mehlhorn, Kurt On fair division for indivisible items. (English) Zbl 1528.91043 Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 25, 17 p. (2018). MSC: 91B32 68W25 PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., LIPIcs -- Leibniz Int. Proc. Inform. 122, Article 25, 17 p. (2018; Zbl 1528.91043) 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
Garg, Jugal; Hoefer, Martin; Mehlhorn, Kurt Approximating the Nash social welfare with budget-additive valuations. (English) Zbl 1403.91210 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 2326-2340 (2018). MSC: 91B32 91B15 91-04 PDFBibTeX XMLCite \textit{J. Garg} et al., in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2326--2340 (2018; Zbl 1403.91210) Full Text: Link
Koprowski, Przemysław; Mehlhorn, Kurt; Ray, Saurabh Corrigendum to: “Faster algorithms for computing Hong’s bound on absolute positiveness”. (English) Zbl 1481.11122 J. Symb. Comput. 87, 238-241 (2018). MSC: 11Y16 12D99 12E05 PDFBibTeX XMLCite \textit{P. Koprowski} et al., J. Symb. Comput. 87, 238--241 (2018; Zbl 1481.11122) Full Text: DOI
Bei, Xiaohui; Garg, Jugal; Hoefer, Martin; Mehlhorn, Kurt Earning limits in Fisher markets with spending-constraint utilities. (English) Zbl 1403.91146 Bilò, Vittorio (ed.) et al., Algorithmic game theory. 10th international symposium, SAGT 2017, L’Aquila, Italy, September 12–14, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66699-0/pbk; 978-3-319-66700-3/ebook). Lecture Notes in Computer Science 10504, 67-79 (2017). MSC: 91B24 91-04 PDFBibTeX XMLCite \textit{X. Bei} et al., Lect. Notes Comput. Sci. 10504, 67--79 (2017; Zbl 1403.91146) Full Text: DOI
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
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
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
Bei, Xiaohui; Garg, Jugal; Hoefer, Martin; Mehlhorn, Kurt Computing equilibria in markets with budget-additive utilities. (English) Zbl 1397.91242 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 8, 14 p. (2016). MSC: 91B26 68Q17 68Q25 91B50 PDFBibTeX XMLCite \textit{X. Bei} et al., LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 8, 14 p. (2016; Zbl 1397.91242) 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
Croitoru, Cosmina; Mehlhorn, Kurt Opposition frameworks. (English) Zbl 1483.68375 Michael, Loizos (ed.) et al., Logics in artificial intelligence. 15th European conference, JELIA 2016, Larnaca, Cyprus, November 9–11, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10021, 190-206 (2016). MSC: 68T27 PDFBibTeX XMLCite \textit{C. Croitoru} and \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 10021, 190--206 (2016; Zbl 1483.68375) Full Text: DOI
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
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
Sagraloff, Michael; Mehlhorn, Kurt Computing real roots of real polynomials. (English) Zbl 1330.65072 J. Symb. Comput. 73, 46-86 (2016). MSC: 65H05 12D10 PDFBibTeX XMLCite \textit{M. Sagraloff} and \textit{K. Mehlhorn}, J. Symb. Comput. 73, 46--86 (2016; Zbl 1330.65072) Full Text: DOI arXiv
Becker, Ruben; Karrenbauer, Andreas; Mehlhorn, Kurt An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. arXiv:1612.04689 Preprint, arXiv:1612.04689 [cs.DS] (2016). BibTeX Cite \textit{R. Becker} et al., ``An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions'', Preprint, arXiv:1612.04689 [cs.DS] (2016) Full Text: arXiv OA License
Mehlhorn, Kurt On the implementation of combinatorial algorithms for the linear exchange market. (English) Zbl 1331.91088 Zaroliagis, Christos (ed.) et al., Algorithms, probability, networks, and games. Scientific papers and essays dedicated to Paul G. Spirakis on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-24023-7/pbk; 978-3-319-24024-4/ebook). Lecture Notes in Computer Science 9295, 87-94 (2015). MSC: 91B26 68Q25 91B52 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 9295, 87--94 (2015; Zbl 1331.91088) Full Text: DOI
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Self-adjusting binary search trees: what makes them tick? (English) Zbl 1466.68032 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 300-312 (2015). MSC: 68P05 68R05 68W05 PDFBibTeX XMLCite \textit{P. Chalermsook} et al., Lect. Notes Comput. Sci. 9294, 300--312 (2015; Zbl 1466.68032) 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
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol Greedy is an almost optimal deque. (English) Zbl 1444.68056 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 152-165 (2015). MSC: 68P05 PDFBibTeX XMLCite \textit{P. Chalermsook} et al., Lect. Notes Comput. Sci. 9214, 152--165 (2015; Zbl 1444.68056) Full Text: DOI arXiv
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
Duan, Ran; Mehlhorn, Kurt A combinatorial polynomial algorithm for the linear Arrow-Debreu market. (English) Zbl 1329.91089 Inf. Comput. 243, 112-132 (2015). MSC: 91B52 68Q25 91B26 PDFBibTeX XMLCite \textit{R. Duan} and \textit{K. Mehlhorn}, Inf. Comput. 243, 112--132 (2015; Zbl 1329.91089) Full Text: DOI arXiv
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming From approximate factorization to root isolation with application to cylindrical algebraic decomposition. (English) Zbl 1357.68305 J. Symb. Comput. 66, 34-69 (2015). MSC: 68W30 14Q05 30C15 65H04 68W40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., J. Symb. Comput. 66, 34--69 (2015; Zbl 1357.68305) Full Text: DOI arXiv
Chalermsook, Parinya; Goswami, Mayank; Kozma, Laszlo; Mehlhorn, Kurt; Saranurak, Thatchaphol Pattern-avoiding access in binary search trees. arXiv:1507.06953 Preprint, arXiv:1507.06953 [cs.DS] (2015). BibTeX Cite \textit{P. Chalermsook} et al., ``Pattern-avoiding access in binary search trees'', Preprint, arXiv:1507.06953 [cs.DS] (2015) Full Text: arXiv OA License
Jurkiewicz, Tomasz; Mehlhorn, Kurt On a model of virtual address translation. (English) Zbl 1347.68015 ACM J. Exp. Algorithm. 19, Article No. 1.9, 28 p. (2014). MSC: 68M07 68P10 68Q05 68Q25 PDFBibTeX XMLCite \textit{T. Jurkiewicz} and \textit{K. Mehlhorn}, ACM J. Exp. Algorithm. 19, Article No. 1.9, 28 p. (2014; Zbl 1347.68015) Full Text: DOI arXiv
Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine A framework for the verification of certifying computations. (English) Zbl 1314.68180 J. Autom. Reasoning 52, No. 3, 241-273 (2014). MSC: 68Q60 68T15 PDFBibTeX XMLCite \textit{E. Alkassar} et al., J. Autom. Reasoning 52, No. 3, 241--273 (2014; Zbl 1314.68180) 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
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
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
Jurkiewicz, Tomasz; Mehlhorn, Kurt The cost of address translation. (English) Zbl 1430.68474 Sanders, Peter (ed.) et al., Proceedings of the 15th workshop on algorithm engineering and experiments (ALENEX ’13), New Orleans, LA, USA, January 7, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 148-162 (2013). MSC: 68W40 PDFBibTeX XMLCite \textit{T. Jurkiewicz} and \textit{K. Mehlhorn}, in: Proceedings of the 15th workshop on algorithm engineering and experiments (ALENEX '13), New Orleans, LA, USA, January 7, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 148--162 (2013; Zbl 1430.68474) Full Text: DOI
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; Sagraloff, Michael; Wang, Pengming From approximate factorization to root isolation. (English) Zbl 1360.68944 Kauers, Manuel (ed.), Proceedings of the 38th international symposium on symbolic and algebraic computation, ISSAC 2013, Boston, MA, USA, June 26–29, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2059-7). 283-290 (2013). MSC: 68W30 14Q05 30C15 65H04 68W40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., in: Proceedings of the 38th international symposium on symbolic and algebraic computation, ISSAC 2013, Boston, MA, USA, June 26--29, 2013. New York, NY: Association for Computing Machinery (ACM). 283--290 (2013; Zbl 1360.68944) 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
Duan, Ran; Mehlhorn, Kurt A combinatorial polynomial algorithm for the linear Arrow-Debreu market. (English) Zbl 1328.91198 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 425-436 (2013). MSC: 91B52 68Q25 91B26 PDFBibTeX XMLCite \textit{R. Duan} and \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 7965, 425--436 (2013; Zbl 1328.91198) Full Text: DOI arXiv
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
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
Czumaj, Artur (ed.); Mehlhorn, Kurt (ed.); Pitts, Andrew (ed.); Wattenhofer, Roger (ed.) Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part I. (English) Zbl 1268.68011 Lecture Notes in Computer Science 7391. Berlin: Springer (ISBN 978-3-642-31593-0/pbk; 978-3-642-31594-7/ebook). xxvii, 862 p. (2012). MSC: 68-06 68Nxx 68Qxx 00B25 PDFBibTeX XMLCite \textit{A. Czumaj} (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9--13, 2012. Proceedings, Part I. Berlin: Springer (2012; Zbl 1268.68011) Full Text: DOI
Czumaj, Artur (ed.); Mehlhorn, Kurt (ed.); Pitts, Andrew (ed.); Wattenhofer, Roger (ed.) Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part II. (English) Zbl 1248.68031 Lecture Notes in Computer Science 7392. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). xxviii, 676 p. (2012). MSC: 68-06 68Nxx 68Qxx 00B25 PDFBibTeX XMLCite \textit{A. Czumaj} (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9--13, 2012. Proceedings, Part II. Berlin: Springer (2012; Zbl 1248.68031) 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
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
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
Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael A general approach to the analysis of controlled perturbation algorithms. (English) Zbl 1247.65024 Comput. Geom. 44, No. 9, 507-528 (2011). Reviewer: Juan Monterde (Burjasot) MSC: 65D18 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 44, No. 9, 507--528 (2011; Zbl 1247.65024) Full Text: DOI
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
Christodoulou, George; Mehlhorn, Kurt; Pyrga, Evangelia Improving the price of anarchy for selfish routing via coordination mechanisms. (English) Zbl 1346.91021 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, 119-130 (2011). MSC: 91A43 68M20 PDFBibTeX XMLCite \textit{G. Christodoulou} et al., Lect. Notes Comput. Sci. 6942, 119--130 (2011; Zbl 1346.91021) Full Text: DOI arXiv
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
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
Mehlhorn, Kurt; Sagraloff, Michael A deterministic algorithm for isolating real roots of a real polynomial. (English) Zbl 1207.65048 J. Symb. Comput. 46, No. 1, 70-90 (2011). Reviewer: Temur Jangveladze (Tbilisi) MSC: 65H04 65Y20 26C10 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. Sagraloff}, J. Symb. Comput. 46, No. 1, 70--90 (2011; Zbl 1207.65048) Full Text: DOI
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
Berberich, Eric; Fogel, Efi; Halperin, Dan; Mehlhorn, Kurt; Wein, Ron Arrangements on parametric surfaces. I: General framework and infrastructure. (English) Zbl 1205.68457 Math. Comput. Sci. 4, No. 1, 45-66 (2010). MSC: 68U05 14Q10 PDFBibTeX XMLCite \textit{E. Berberich} et al., Math. Comput. Sci. 4, No. 1, 45--66 (2010; Zbl 1205.68457) Full Text: DOI
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 Reliable and efficient geometric computing. (English) Zbl 1294.68143 Fukuda, Komei (ed.) et al., Mathematical software – ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13–17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15581-9/pbk). Lecture Notes in Computer Science 6327, 10-11 (2010). MSC: 68U05 65D17 65D18 68U07 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 6327, 10--11 (2010; Zbl 1294.68143) Full Text: DOI
Mehlhorn, Kurt; Schweitzer, Pascal Progress on certifying algorithms. (English) Zbl 1288.68242 Lee, Der-Tsai (ed.) et al., Frontiers in algorithmics. 4th international workshop, FAW 2010, Wuhan, China, August 11–13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14552-0/pbk). Lecture Notes in Computer Science 6213, 1-5 (2010). MSC: 68W01 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{P. Schweitzer}, Lect. Notes Comput. Sci. 6213, 1--5 (2010; Zbl 1288.68242) Full Text: DOI
Mehlhorn, Kurt; Ray, Saurabh Faster algorithms for computing Hong’s bound on absolute positiveness. (English) Zbl 1206.11151 J. Symb. Comput. 45, No. 6, 677-683 (2010); corrigendum ibid. 87, 238-241 (2018). Reviewer: Hendrik Hubrechts (Leuven) MSC: 11Y16 12D99 12E05 12Y05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Ray}, J. Symb. Comput. 45, No. 6, 677--683 (2010; Zbl 1206.11151) Full Text: DOI 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
Mehlhorn, Kurt; Sagraloff, Michael Isolating real roots of real polynomials. (English) Zbl 1237.68257 May, John P. (ed.), ISSAC 2009. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, July 28–31, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-609-0). 247-254 (2009). MSC: 68W30 12D10 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. Sagraloff}, in: Proceedings of the 2009 international symposium on symbolic and algebraic computation, ISSAC 2009, Seoul, July 28--31, 2009. New York, NY: Association for Computing Machinery (ACM). 247--254 (2009; Zbl 1237.68257) Full Text: DOI
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
Mehlhorn, Kurt; Sack, Jörg; Zaks, Joseph Note on the paper “K-vertex guarding simple polygons”. (English) Zbl 1168.52005 Comput. Geom. 42, No. 6-7, 722 (2009). MSC: 52A30 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 42, No. 6--7, 722 (2009; Zbl 1168.52005) 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
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)
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. 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
Halperin, Dan (ed.); Mehlhorn, Kurt (ed.) Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. (English) Zbl 1149.68011 Lecture Notes in Computer Science 5193. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). xvii, 844 p. (2008). MSC: 68-06 68Wxx 00B25 PDFBibTeX XMLCite \textit{D. Halperin} (ed.) and \textit{K. Mehlhorn} (ed.), Algorithms -- ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15--17, 2008. Proceedings. Berlin: Springer (2008; Zbl 1149.68011) Full Text: DOI
Mehlhorn, Kurt; Sanders, Peter Algorithms and data structures. The basic toolbox. (English) Zbl 1146.68069 Berlin: Springer (ISBN 978-3-540-77977-3/hbk). xii, 300 p. (2008). Reviewer: Zhizhang Shen (Plymouth/New Hampshire) MSC: 68W05 68P05 68P10 68R10 68W40 68-01 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{P. Sanders}, Algorithms and data structures. The basic toolbox. Berlin: Springer (2008; Zbl 1146.68069) Full Text: DOI
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee Classroom examples of robustness problems in geometric computations. (English) Zbl 1135.65311 Comput. Geom. 40, No. 1, 61-78 (2008). MSC: 65D18 PDFBibTeX XMLCite \textit{L. Kettner} et al., Comput. Geom. 40, No. 1, 61--78 (2008; Zbl 1135.65311) Full Text: DOI
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 Reliable geometric computing. (English) Zbl 1209.68587 Waldmann, Karl-Heinz (ed.) et al., Operations research proceedings 2006. Selected papers of the annual international conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6–8, 2006. Berlin: Springer (ISBN 978-3-540-69994-1/pbk). 111 (2007). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, in: Operations research proceedings 2006. Selected papers of the annual international conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6--8, 2006. Berlin: Springer. 111 (2007; Zbl 1209.68587) Full Text: DOI
Gotsman, Craig; Kaligosi, Kanela; Mehlhorn, Kurt; Michail, Dimitrios; Pyrga, Evangelia Cycle bases of graphs and sampled manifolds. (English) Zbl 1171.65334 Comput. Aided Geom. Des. 24, No. 8-9, 464-480 (2007). MSC: 65D17 68U07 PDFBibTeX XMLCite \textit{C. Gotsman} et al., Comput. Aided Geom. Des. 24, No. 8--9, 464--480 (2007; Zbl 1171.65334) Full Text: DOI Link
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
Berberich, Eric; Fogel, Efi; Halperin, Dan; Mehlhorn, Kurt; Wein, Ron Sweeping and maintaining two-dimensional arrangements on surfaces: A first step. (English) Zbl 1151.68700 Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 645-656 (2007). MSC: 68U05 PDFBibTeX XMLCite \textit{E. Berberich} et al., Lect. Notes Comput. Sci. 4698, 645--656 (2007; Zbl 1151.68700) Full Text: DOI
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
Hachenberger, Peter; Kettner, Lutz; Mehlhorn, Kurt Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments. (English) Zbl 1118.65308 Comput. Geom. 38, No. 1-2, 64-99 (2007). MSC: 65D18 PDFBibTeX XMLCite \textit{P. Hachenberger} et al., Comput. Geom. 38, No. 1--2, 64--99 (2007; Zbl 1118.65308) Full Text: DOI