Sandpile transience on the grid is polynomially bounded. - László Babai; Igor Gorodezky (SODA, 2007)

Improved Lower Bounds for the Universal and a priori TSP. - Igor Gorodezky; Robert D. Kleinberg; David B. Shmoys; Gwen Spencer (APPROX-RANDOM, 2010)

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) - Prahladh Harsha; Moses Charikar; Matthew Andrews; Sanjeev Arora; Subhash Khot; Dana Moshkovitz; Lisa Zhang; Ashkan Aazami; Dev Desai; Igor Gorodezky; Geetha Jagannathan; Alexander S. Kulikov; et al. (CoRR, 2010)

Generalized loop-erased random walks and approximate reachability. - Igor Gorodezky; Igor Pak (Random Struct. Algorithms, 2014)