The Graph Isomorphism Problem: a journey through theory-practice synergies

isomorphism problem. Being the core algorithmic problem for the
computation of symmetries of combinatorial objects, practical
implementations have been heavily engineered over the past decades.
Having a peculiar but yet unknown computational complexity, the problem
has also been in the crosshairs of theoretical research. Major
algorithmic ideas and applications have emerged over time. In this talk
I will survey the synergy effects that have arisen from looking at both
theoretical and practical aspects at the same time. The journey starts
with the state of research when I began my PhD at the MPI under the
supervision of Kurt Mehlhorn. The talk ends with new practical
developments inspired by theory. The journey, of course, is nowhere near
its end, and I will provide an outlook about future directions.