CS-E4555 - Combinatorics, 07.01.2019-12.04.2019

Topic outline

• Lectures
  • 

    Lecture 1 (9 January): Introduction. Algorithms and Structures Page

    Not available unless: You are a(n) Student
  • 

    Lecture 2 (16 January): Graph Coloring Page

    Not available unless: You are a(n) Student

    In this class, we will go through some classical greedy and local recoloring based algorithms for graph coloring.

    
    

  • 

    Lecture 3 (23 January): Matching Page

    Not available unless: You are a(n) Student
  • 

    Lecture 4 (30 January): Compression of graphs Page

    Not available unless: You are a(n) Student
  • 

    Lecture 5&6 (6, 13 February): Treewidth Page

    Not available unless: You are a(n) Student
  • 

    Lecture 7 (27 February): Randomized Algorithm for Matching & Intro to Probability Page

    Not available unless: You are a(n) Student
  • 

    Lecture 8 (13 March): Probabilistic Method. Linearity of Expectations. Alterations. Chernoff Bounds Page

    Not available unless: You are a(n) Student
  • 

    Lecture 9 (20 March): Lovasz Local Lemma and Satisfiability Page

    Not available unless: You are a(n) Student
  • 

    Lecture 10 (27 March): Optimal Packet Routing. Page

    Not available unless: You are a(n) Student
  • 

    Lecture 11 (3 April): Final exam information & project discussions Page

    Not available unless: You are a(n) Student