Lecture notes. Initially the links point to lecture notes from the course given at 2014, and as the course progresses, some lecture notes are replaced by new updated ones.

Lecture 1,2 (2, 9 November 2017): Sorting and Selection
Lecture 3 (23 November 2017): Greedy algorithms and Matroids
Lectures 4 and 5 (30 November and 7 December 2017): Matchings
Lectures 6 and 7 (21 and 28 December 2017 and part of 4 of January 2018): Treewidth and graph minors
Lectures 8, 9, 10 (4, 11, 25 January 2018): Spectral graph theory and refutation of random 4SAT
Lecture 11 (February 1, 2018): The local lemma and satisfying sparse k-SAT

Handouts (homework) for course.

Handout 1 (9 November 2017): Sorting and Selection
Handout 2 (23 November 2017): Greedy algorithms and Matroids
Handout 3 (7 December 2017): Matching
Handout 4 (4 January 2018): Treewidth and graph minors.
Handout 5 (11 January 2018): Spectral graph theory.

If you find errors in lecture notes or handouts, please let me know.