- Proof Complexity and the P vs. NP ProblemNMAG536 | Faculty of Mathematics and Physics
- Introduction to Complexity and Computability +1NTIX090 | Faculty of Mathematics and Physics
- Complexity for CryptographyNMMB405 | Faculty of Mathematics and Physics
- Algorithms on LatticesNMMB411 | Faculty of Mathematics and Physics
- Introduction to complexity of CSPNMAG563 | Faculty of Mathematics and Physics
- Automata and Computational ComplexityNMMB415 | Faculty of Mathematics and Physics
- Specialized field course in ZoologyMB170T22 | Faculty of Science
- Boolean Function ComplexityNMAG457 | Faculty of Mathematics and Physics
- Protected areas in the world - shortMO550P114 | Faculty of Science
- ComputabilityNLTM021 | Faculty of Mathematics and Physics
- Arithmetic and AlgorithmsALG110008 | Faculty of Arts
- Advanced field course in zoologyMB170T23 | Faculty of Science
- Crossing numbers of graphsNDMI099 | Faculty of Mathematics and Physics
- Introduction to Approximation and Randomized AlgorithmsNDMI084 | Faculty of Mathematics and Physics
- Approximation and Online Algorithms +1NDMI018 | Faculty of Mathematics and Physics
- Geometric Representations of Graphs 2NDMI035 | Faculty of Mathematics and Physics
- Practical Language Course V (Stylistics)APL400023 | Faculty of Arts
- Popularization seminarMB162S12 | Faculty of Science
- Summer School I. +1YME03P6ZI | Faculty of Humanities
- Summer School II. +1YME04P6ZI | Faculty of Humanities
- Computational ComplexityALG500005 | Faculty of Arts
- Excursion: Environmental protection and landscape managementMO550C60 | Faculty of Science
- Fieldwork II.YME11P6ZI | Faculty of Humanities
- Fieldwork I. +1YME13P6ZI | Faculty of Humanities
- Nonuniform computational modelsNTIN082 | Faculty of Mathematics and Physics