A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” Random Structures and Algorithms, vol. 62, no. 4. Wiley, pp. 1035–1055, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/11706
DOI: 10.1002/rsa.21106
WoS: 000828530400001

M. Krivelevich, M. A. Kwan, P. Loh, and B. Sudakov, “The random kmatchingfree process,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp. 692–716, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/9567
DOI: 10.1002/rsa.20814
arXiv: 1708.01054

A. Ferber, M. A. Kwan, and B. Sudakov, “Counting Hamilton cycles in sparse random directed graphs,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp. 592–603, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/9565
DOI: 10.1002/rsa.20815
arXiv: 1708.07746

M. A. Kwan and B. Sudakov, “Intercalates and discrepancy in random Latin squares,” Random Structures and Algorithms, vol. 52, no. 2. Wiley, pp. 181–196, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/9568
DOI: 10.1002/rsa.20742
arXiv: 1607.04981

M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” Random Structures and Algorithms, vol. 11, no. 4. Wiley, pp. 369–379, 1997.
LibreCat: https://research-explorer.ista.ac.at/record/11883
DOI: 10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x