The research conducted at our Department focuses on the analysis and design of algorithms for certain problems of discrete optimization and operational research. Most of our work is carried out in the following areas:
- graph-theoretical algorithms, and especially graph coloring methods and non-classical graph coloring  models,
- algorithms for network optimization and for the study of dynamic networks,
- distributed and on-line algorithms for graph coloring problems,
- task scheduling in a multiprocessor environment,
- algorithms for school timetabling,
- guarding and searching problems in graph theory and computational geometry,
- combinatorial methods for selected problems of computational biology,
- artificial intelligence methods applied in game design,
- methods of graphical rendering and texturing based on fractal and recursive procedures,
- bounds on generalised Ramsey numbers using computer-aided methods.