Liebenau, Anita, et al. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.”10.1002/rsa.21106__Random Structures and Algorithms, vol. 62, no. 4, Wiley, 2023, pp. 1035–55, doi:10.1002/rsa.21106.
LibreCat: https://research-explorer.ista.ac.at/record/11706
DOI: 10.1002/rsa.21106
WoS: 000828530400001

Krivelevich, Michael, et al. “The Random Kmatchingfree Process.”10.1002/rsa.20814__Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 692–716, doi:10.1002/rsa.20814.
LibreCat: https://research-explorer.ista.ac.at/record/9567
DOI: 10.1002/rsa.20814
arXiv: 1708.01054

Ferber, Asaf, et al. “Counting Hamilton Cycles in Sparse Random Directed Graphs.”10.1002/rsa.20815__Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 592–603, doi:10.1002/rsa.20815.
LibreCat: https://research-explorer.ista.ac.at/record/9565
DOI: 10.1002/rsa.20815
arXiv: 1708.07746

Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.”10.1002/rsa.20742__Random Structures and Algorithms, vol. 52, no. 2, Wiley, 2018, pp. 181–96, doi:10.1002/rsa.20742.
LibreCat: https://research-explorer.ista.ac.at/record/9568
DOI: 10.1002/rsa.20742
arXiv: 1607.04981

Henzinger, Monika H., and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.”10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x__Random Structures and Algorithms, vol. 11, no. 4, Wiley, 1997, pp. 369–79, doi:10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x.
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