Benjamin Bergougnoux gave an online talk on proving tight lower bounds for the running time of various problems parameterized by rank-width at the Virtual Discrete Math Colloquium

On February 1, 2023, Benjamin Bergougnoux from the University of Warsaw gave an online talk at the Virtual Discrete Math Colloquium about proving tight lower bounds for the running time of various problems parameterized by rank-width. The title of his talk was “Tight Lower Bounds for Problems Parameterized by Rank-width“.