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+
NDMI011	Combinatorics and Graph Theory 1	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI012	Combinatorics and Graph Theory 2	summer	summer 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 1	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI056	Selected Chapters on Combinatorics 2	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI058	Flows and Cycles in Graphs	summer	summer s.:2/2, C+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	yes	no		no
NDMI073	Combinatorics and Graph Theory 3	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
NDMI084	Introduction to Approximation and Randomized Algorithms	winter	winter s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI085	Graph minor theory	summer	summer s.:2/2, C+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
NDMI096	Complex network analysis	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NDMI105	Topics in Structural Graph Theory and Algorithms	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NDMI116	Seminar on the application of complex networks	winter	winter s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NDMI119	Advanced Topics in Theory of Computing, Discrete Mathematics and Optimization 1	both	0/4, C [HT]	32-IUUK	11320	no	no		no
NDMI120	Advanced Topics in Theory of Computing, Discrete Mathematics and Optimization 2	both	0/4, C [HT]	32-IUUK	11320	no	no		no
NDMI121	Advanced Topics in Theory of Computing, Discrete Mathematics and Optimization 3	both	0/4, C [HT]	32-IUUK	11320	no	no		no
NDMI122	The Graph Isomorphism Problem	winter	winter s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NMAI059	Probability and Statistics 1	summer	summer s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NMAI073	Probability and Statistics 2	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NMIN105	Discrete Mathematics	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NMIN365	Sage	summer	summer 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
NTIN022	Probabilistic Techniques	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN081	Computational complexity and interactive protocols	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NTIN082	Nonuniform computational models	summer	summer s.:2/0, Ex [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
NTIN095	Probabilistic Techniques 2	summer	summer s.:2/2, 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 theory of computing	both	0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN103	Introduction to Parameterized Algorithms	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN104	Foundations of theoretical cryptography	winter	winter s.:2/1, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN111	Selected Topics in Algorithms II	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NTIN113	Integer Programming and Computational Social Choice	summer	summer s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NTIN114	Streaming algorithms for Big Data	winter	winter s.:2/0, Ex [HT]	32-IUUK	11320	no	no		no
NTIN115	LEAN – Computer-Assisted Proofs	winter	winter s.:2/2, C+Ex [HT]	32-IUUK	11320	no	no		no
NTIN116	Selected topics in probability 1	winter	winter s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN117	Selected topics in probability 2	summer	summer s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN118	Math content lab	summer	summer s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN119	Algorithmic problem seminar	both	0/2, C [HT]	32-IUUK	11320	no	no		no
NTIN120	Seminar on recent advances in computer science	both	0/2, C [HT]	32-IUUK	11320	no	no		no
NUIN022	Seminar in mathematics	summer	summer s.:0/2, C [HT]	32-IUUK	11320	no	no		no
NUIN024	Seminar on linear algebra	winter	winter s.:0/2, C [HT]	32-IUUK	11320	no	no		no