  We give an overview of recent advances on the graph isomorphism problem. Our
main focus will be on Babai's quasi-polynomial time isomorphism test and
subsequent developments that led to the design of isomorphism algorithms with a
quasi-polynomial parameterized running time of the from
$n^{\text{polylog}(k)}$, where $k$ is a graph parameter such as the maximum
degree. A second focus will be the combinatorial Weisfeiler-Leman algorithm.
