Algorithms for solving discrete problems and optimizing discrete structures are referred to as discrete algorithms, for short. The design of discrete algorithms is of central importance for computer science and its applications. We develop and analyze fundamental discrete algorithms and relate the development of discrete algorithms to specific applications in science and technology. Our objective is to establish a link between the progress in basic research on algorithms and the demands from the applications side on progress in algorithms research. Application areas in engineering mostly concern optimization problems in design and manufacturing.
Scientific applications focus on computational biology and chemistry.
Areas of application considered currently are Bioinformatics , Computational Chemistry , Cutting and Packing , Petri Nets and Computer Algebra .