## Discrete mathematics structures and methods

Discrete mathematic and theoretical computer science is a substantial part of theoretical foundations of contemporary information technologies. Research in this field is often highly multidisciplinary, with an overlap towards many branches of mathematics: algebra (group theory, linear algebra), probability theory (probabilistic methods in combinatorics, probabilistic analysis of algorithms), geometry (combinatorial geometry, algebraic geometry), topology and others.

Research is focused on structural problems in graph theory (Hamiltonian graph theory, graph operators and closure concepts, special classes of graphs, graph factorizations, chromatic theory of graphs and general combinatorial structures), including development of algorithms, on computational complexity and on optimization problems in scheduling and control theory.