Lab's home

Research directions

Analysis of discrete optimization problems (complexity analysis, approximability, polynomially solvable cases):
discrete allocation problems
bin packing problems
scheduling; calendar planning with resourse constraints
Graph Theory (with emphasis on colourings and topological problems)
Combinatorics (probabilistic methods in combinatorics)
Finite partially ordered sets