The first paper I plan to review is
A Message-Passing Algorithm for Graph Isomorphism, which was brought up by user Turbo. I haven't read the paper in detail yet. I see that the author implemented his algorithm and compared its performance to Nauty, which is already a good sign that reading this paper might be worth my time.