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