Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5 Publications
2023 | Journal Article | IST-REx-ID: 11706 | 
Liebenau, A., Mattos, L., Mendonca dos Santos, W., & Skokan, J. (2023). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.21106
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Journal Article | IST-REx-ID: 9567 |
Krivelevich, M., Kwan, M. A., Loh, P., & Sudakov, B. (2018). The random k‐matching‐free process. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20814
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 9565 |
Ferber, A., Kwan, M. A., & Sudakov, B. (2018). Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20815
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 9568 |
Kwan, M. A., & Sudakov, B. (2018). Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20742
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1997 | Journal Article | IST-REx-ID: 11883
Henzinger, M. H., & Thorup, M. (1997). Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x
View
| DOI