Graduate Program: Computational Discrete Mathematics

Taking into consideration the algorithmic point of view, discrete mathematics has developed from classical fields like combinatorics or graph-theory into a filed which unifies aspects of fundamental as well as of applied science in a unique way. Examples are: coding theory and data security, algorithmic number theory and computational algebra, computational geometry and robotics, network planning, design of algorithms - within all these topics, computational discrete mathematics delivers foundations and leads to the applications. the main goal of the graduate program is to work out contributions to important actual questions within the fundamental principles and applications of science by concentrating research and education.

More information