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
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
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