Or Zamir

  1. Title:
    Exponential Exact Algorithms for NP Complete Problems

    Speaker:

    Link:

  2. Title:
    Random k-out subgraphs

    Speaker:

    Link:

  3. Title:
    Tight Space Complexity of the Coin Problem

    Speaker:

    Link:

  4. Title:
    Exact algorithms for graph coloring

    Speaker:

    Link:

  5. Title:
    Hardness of Easy Problems and Fine-Grained Complexity

    Speaker:

    Link:

  6. Title:
    The Hypergraph Container Method, Partition Containers, and Algorithmic Applications

    Speaker:

    Link: