Hugo Jacob gave an online talk on the parameterized algorithm to approximate the tree-partition-width of graphs at the Virtual Discrete Math Colloquium

On November 9, 2022, Hugo Jacob from the ENS Paris-Saclay gave an online talk at the Virtual Discrete Math Colloquium on the parameterized algorithm to approximate the tree-partition-width of graphs at the Virtual Discrete Math Colloquium. The title of his talk was “On the parameterized complexity of computing tree-partitions“.