Tuukka Korhonen gave an online talk on a faster FPT-approximation algorithm for rank-width at the Virtual Discrete Math Colloquium

On November 25, 2021, Tuukka Korhonen from the University of Bergen gave an online talk on a faster FPT-approximation algorithm for rank-width at the Virtual Discrete Math Colloquium. The title of his talk was “Fast FPT-Approximation of Branchwidth“.