Jan Soukup
and he will talk about paper
Twinwidth of planar graphs is at most 8
by Petr Hliněný and Jan Jedelský.
This will be a treat to both the mathematicians among us (nice proof about planar graphs) and as well to the computer scientists (twin width is a recently defined parameter that seems to become a central part of theory).