The research focuses on discrete mathematics and theoretical computer science, which form the theoretical basis of modern information technologies. This field is highly multidisciplinary, overlapping with a number of mathematical disciplines: algebra (group theory, linear algebra), probability theory (probabilistic methods in combinatorics, probabilistic analysis of algorithms), geometry (combinatorial geometry, algebraic geometry), topology, and others.
The research team addresses primarily structural problems in graph theory (Hamiltonian graph theory, graph operations of the closure type, special classes of graphs, graph factorization, chromatic graph theory, and general issues of colorability of combinatorial structures), including the development of relevant algorithms, as well as computational complexity problems and optimization problems in scheduling and control theory. In the field of applied research, we can mention in particular the optimization of nuclear reactor fuel loads and delivery and transport tasks on networks.