The Algorithms and Complexity Department is headed by Prof. Dr. Kurt Mehlhorn.
The department investigates a broad range of theoretical and practical aspects of modern algorithmics. We design new algorithms and algorithmic techniques, analyze their efficiency and the quality of their solutions, develop provably efficient and correct software, and package our programs in software libraries. The strength of our approach lies in the fact that we consider these aspects in unity and not in isolation.
Positions, Long Term Visits, Postdoc Positions, Ph.D. Applications, Internships and other Offers
Lectures, Seminars, Bachelor and Master Theses
Seminar program, Advanced Mini Courses
PhD Theses, Diploma Theses, Publications of Group Members
Collection of useful Links to Internet Sites