Representation and generation of combinatorial objects. Searching: exhaustive search and its approximations and fast search techniques. Sorting and related problems. Graph algorithms. Greedy method and the theory of materials. NP-Hard and NP-Complete combinatorial problems.​