Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Filter:

Faculty:
Department:

Code	Title	Semester	Hours per week, examination	Department	Faculty	Cyclical teaching	Virtual mobility	Capacity	4EU+
NAIL063	Set Theory	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMA005	Discrete Mathematics	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI011	Combinatorics and Graph Theory I	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI012	Combinatorics and Graph Theory II	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI018	Approximation and Online Algorithms	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI025	Randomized Algorithms	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI050	Introduction to Problem Solving in Combinatorics, Mathematics and Other Fields (IPS) I	winter	winter s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NDMI051	Introduction to Problem Solving in Combinatorics, Mathematics and Other Fields (IPS) II	summer	summer s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NDMI055	Selected Chapters on Combinatorics I	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI056	Selected Chapters on Combinatorics II	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI058	Flows and Cycles in Graphs	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI060	Coloring of Graphs and Other Combinatorial Structures	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI065	Matroid Theory	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI073	Combinatorics and Graph Theory III	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI080	Combinatorial game theory	winter	winter s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI082	Combinatorial Etudes	both	0/2, C [HT]	32-IUUK	11320	no	no		no
NDMI083	Matroid Theory II	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI087	Analytic combinatorics	summer	summer s.:2/1, Ex [HT]	32-IUUK	11320	no	no		no
NDMI089	Combinatorics for bioinformatics	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI092	Introduction to extremal graph theory	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NLTM038	Referative seminar on substructural logics	summer	summer s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NLTM040	Substructural logics	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NMAI164	Visual Complex Analysis	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NMIN365	Sage	winter	winter s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NPRG015	Seminar for preparing students for contests in programming	both	0/2, C [HT]	32-IUUK	11320	no	no		no
NPRG049	Programming language F#	winter	winter s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN022	Probabilistic Techniques	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN072	Seminar on Approximation and Online Algorithms	both	0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN085	Selected Topics in Computational Complexity I	winter	winter s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN086	Selected Topics in Computational Complexity II	summer	summer s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN100	Introduction to Information Transmission and Processing	summer	summer s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN101	Selected Topics in Algorithms	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NTIN102	Seminar on limits of efficient computation	both	0/2, C [HT]	32-IUUK	11320	no	no		no