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.
LibreCat: https://research-explorer.ista.ac.at/record/11706
DOI: 10.1002/rsa.21106
WoS: 000828530400001

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

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

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

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.
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