📢 Our first TCS+ talk of the season will be Wednesday, Sep 16 (10am PT, 1pm ET, 19:00 CEST): Tselil Schramm, from Stanford, will give a survey of "10 years of the low-degree framework in average-case complexity"

RSVP to receive the link (one day prior to the talk): docs.google.com/forms/d/e/1F...

I poured my soul into building this course last fall:

📚 Graph Algorithms via Graph Decomposition 📚

Graph decomposition has been a powerful framework in graph algorithms for over 20 years, but the literature is scattered and technical.

Thus, I tried to organize part of it into one coherent story.