“Edge colouring multigraphs”
Penny Haxell
“Two Topics in Discrete Algorithms: Certifying Algorithms and Slime Mold Computations.”
Kurt Mehlhorn
Material for the course (on top of the page)
“CONGEST Algorithms and Lower Bounds.”
Rotem Oshman
Student speakers
Felipe Benitez: Slides, Personal website
Tomas Lagos: Slides