The admission for the Program is annual, starting at 2015, with no future plans for discontinuance. Education lasts for two years and ends normally with defence of Master’s Thesis.

### Fall Semester 2015

**Basics** (elective, just for those who want to refresh their knowledge)

- Re-introduction to calculus.
- Re-introduction to algebra.
- Re-introduction to сombinatorics and graph theory.
- Re-introduction to probability.

“Re-introduction” does not only mean that “We again introduce you…”, but it also means that “We introduce you, say, to calculus looking at it from a bit more combinatorial point of view than it is usually done”.

**Obligatory courses**

- Advanced graph theory.
- Coding theory.
- Combinatorial geometry. Part 1.

**Courses by visiting professors**

- Janos Pach (EPFL, Swiss) – Combinatorial geometry.

**Other activities**

- Interdepartmental seminar on Discrete Mathematics (every week).
- Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
- Research meetings with scientific advisors (office hours).

### Spring Semester 2016

**Main courses**

- Game theory. Part 1.
- Random graphs. Part 1.
- Computational complexity.
- Combinatorial geometry. Part 2.

**Courses by visiting professors**

- David Gamarnik (MIT, USA) – Random graphs.
- G.O.H. Katona (Renyi Institute, Budapest) – Extremal theory of finite sets.

**Other activities**

- Interdepartmental seminar on Discrete Mathematics (every week).
- Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
- Research meetings with scientific advisors (office hours).

### Fall Semester 2016

**Main courses**

- Game theory. Part 2.
- Random graphs. Part 2.
- Extremal combinatorics.
- Additive combinatorics.

**Courses by visiting professors**

- Benny Sudakov (ETH, Zurich) – Dependent Random Choice in Extremal Combinatorics.

**Other activities**

- Interdepartmental seminar on Discrete Mathematics (every week).
- Seminar on Discrete Mathematics and its Applications in Network Analysis (every week at Yandex, the top Russian internet search engine).
- Research meetings with scientific advisors (office hours).

### Spring Semester 2017

**Main courses**

- Complex networks.
- Discrete optimization.
- Algebraic combinatorics.

**Courses by visiting professors**

- Prasad Tetali (GA Tech, USA) – TBA.

**Other activities**

- Interdepartmental seminar on Discrete Mathematics (every week).
- Research work and preparation of Master’s Thesis.