Asymmetric Ramsey properties of random graphs involving cliques and cycles
A. Liebenau, L. Mattos, W. Mendonca dos Santos, J. Skokan, Random Structures and Algorithms 62 (2023) 1035–1055.

Counting Hamilton cycles in sparse random directed graphs
A. Ferber, M.A. Kwan, B. Sudakov, Random Structures and Algorithms 53 (2018) 592–603.

The random kmatchingfree process
M. Krivelevich, M.A. Kwan, P. Loh, B. Sudakov, Random Structures and Algorithms 53 (2018) 692–716.

Intercalates and discrepancy in random Latin squares
M.A. Kwan, B. Sudakov, Random Structures and Algorithms 52 (2018) 181–196.

Sampling to provide or to bound: With applications to fully dynamic graph algorithms
M.H. Henzinger, M. Thorup, Random Structures and Algorithms 11 (1997) 369–379.