Colouring powers of cycles from random lists. - Michael Krivelevich; Asaf Nachmias (Eur. J. Comb., 2004)

Coloring complete bipartite graphs from random lists. - Michael Krivelevich; Asaf Nachmias (Random Struct. Algorithms, 2006)

Mixing Time Power Laws at Criticality. - Yun Long; Asaf Nachmias; Yuval Peres (FOCS, 2007)

Testing the Expansion of a Graph. - Asaf Nachmias; Asaf Shapira (Electron. Colloquium Comput. Complex., 2007)

Critical percolation on random regular graphs. - Asaf Nachmias; Yuval Peres (Random Struct. Algorithms, 2010)

The Evolution of the Cover Time. - Martin T. Barlow; Jian Ding; Asaf Nachmias; Yuval Peres (Comb. Probab. Comput., 2011)

Random walks on stochastic hyperbolic half planar triangulations. - Omer Angel; Asaf Nachmias; Gourab Ray (Random Struct. Algorithms, 2016)

Slightly subcritical hypercube percolation. - Tim Hulshof; Asaf Nachmias (Random Struct. Algorithms, 2020)

The diameter of the uniform spanning tree of dense graphs. - Noga Alon; Asaf Nachmias; Matan Shalev (Comb. Probab. Comput., 2022)