On December 9, 2025, Tuukka Korhonen from the University of Copenhagen gave a talk at the Discrete Math Seminar on a dynamic algorithm for maintaining a tree decomposition of a graph. The title of his talk was “Dynamic Treewidth in Logarithmic Time“.


