![]() |
![]() ![]() | ![]() ![]() | ![]() ![]() | Hours per week, examination | Department | Faculty | Virtual mobility | Capacity | |
![]() |
NAIL076 | Logic Programming 1 | winter | winter s.:2/0 Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NAIL083 | Mathematical Models of Cell Activity | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI010 | Graph Algorithms | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI013 | Combinatorial and Computational Geometry 2 | summer | summer s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI015 | Combinatorial Counting | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI018 | Approximation and Online Algorithms | summer | summer s.:2/2 C+Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI025 | Randomized Algorithms | summer | summer s.:2/2 C+Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI028 | Linear Algebra Applications in Combinatorics | winter | winter s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI036 | Combinatorial Structures | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI037 | Geometric Representations of Graphs 1 | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI045 | Analytic and Combinatorial Number Theory | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI055 | Selected Chapters on Combinatorics 1 | winter | winter s.:2/0 Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI056 | Selected Chapters on Combinatorics 2 | summer | summer s.:2/0 Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI059 | Graph Minors and Tree Decompositions | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI060 | Coloring of Graphs and Other Combinatorial Structures | winter | winter s.:2/0 Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI064 | Applied Discrete Mathematics | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI065 | Matroid Theory | summer | summer s.:2/2 C+Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI066 | Algebraic Number Theory and Combinatorics | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI067 | Flows, Paths and Cuts | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI073 | Combinatorics and Graph Theory 3 | winter | winter s.:2/2 C+Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NDMI095 | Topological and geometric graphs | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI099 | Crossing numbers of graphs | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI106 | Geometric seminar | both | 0/2 C [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI108 | Ramsey Theory | winter | winter s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMI109 | Additive Combinatorics | summer | summer s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NDMX013 | Combinatorial and Computational Geometry II | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NDMX018 | Approximation and Online Algorithms | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NDMX025 | Randomized Algorithms | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NDMX028 | Linear Algebra Applications in Combinatorics | winter | winter s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NDMX065 | Matroid Theory | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NDMX073 | Combinatorics and Graph Theory III | winter | winter s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NMAI040 | Introduction to Number Theory | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NMAI064 | Mathematical Structures | summer | summer s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NMAI065 | Fundamentals of Category Theory for Computer Scientists | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NMAI066 | Topological and Algebraic Methods | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NMAI067 | Logic in Computer Science | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NMAI074 | Infinite sets | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NMAX064 | Mathematical Structures | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NMMA901 | Introduction to Complex Analysis (O) | winter | winter s.:2/2 C+Ex [HT] | 32-KMA | 11320 | no | |
![]() |
NMMA903 | Measure and Integration Theory (O) | winter | winter s.:4/2 C+Ex [HT] | 32-KMA | 11320 | no | |
![]() |
NMMA931 | Introduction to Functional Analysis (O) | winter | winter s.:4/2 C+Ex [HT] | 32-KMA | 11320 | no | |
![]() |
NOPT008 | Nonlinear Optimisation Algorithms | summer | summer s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT013 | Selected economic-mathematical models | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT016 | Integer Programming | summer | summer s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT017 | Multiobjective Optimisation | summer | summer s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT018 | Fundamentals of Nonlinear Optimization | winter | winter s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT021 | Game Theory | winter | winter s.:2/0 Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT034 | Mathematical Programming and Polyhedral Combinatorics | summer | summer s.:2/1 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NOPT042 | Constraint Programming | winter | winter s.:2/2 C+Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NOPT059 | Large-scale optimization | winter | winter s.:2/2 C+Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NOPX008 | Nonlinear Optimisation Algorithms | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NOPX016 | Integer Programming | summer | summer s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NOPX018 | Fundamentals of Nonlinear Optimization | winter | winter s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NOPX034 | Mathematical Programming and Polyhedral Combinatorics | winter | winter s.:2/1 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NOPX042 | Constraint Programming | winter | winter s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NTIN017 | Parallel Algorithms | summer | summer s.:2/0 Ex [HT] | 32-KSVI | 11320 | no | |
![]() |
NTIN022 | Probabilistic Techniques | winter | winter s.:2/2 C+Ex [HT] | 32-IUUK | 11320 | no | |
![]() |
NTIN063 | Complexity | summer | summer s.:2/1 C+Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NTIN064 | Computability | summer | summer s.:2/0 Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NTIN065 | Computability 2 | summer | summer s.:2/0 Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NTIN066 | Data Structures 1 | both | 2/2 C+Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NTIN067 | Data Structures 2 | summer | summer s.:2/0 Ex [HT] | 32-KTIML | 11320 | no | |
![]() |
NTIN103 | Introduction to Parameterized Algorithms | winter | winter s.:2/2 C+Ex [HT] | 32-KAM | 11320 | no | |
![]() |
NTIX022 | Probabilistic Techniques | winter | winter s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NTIX063 | Complexity | summer | summer s.:2/1 C+Ex [HT] | 32-STUD | 11320 | no | |
![]() |
NTIX103 | Introduction to Parameterized Algorithms | winter | winter s.:2/2 C+Ex [HT] | 32-STUD | 11320 | no |