Most important new papers in computational complexity
The recent paper of László Babai showing that Graph Isomorphism is in Quasi-P is already a classic.

Here is a more accessible exposition of the result published in the ICM 2018 proceedings.