Campbell R, Hörsch F, Moore B. Decompositions into two linear forests of bounded lengths. Discrete Mathematics. 2024;347(6). doi:10.1016/j.disc.2024.113962
LibreCat: https://research-explorer.ista.ac.at/record/15163
DOI: 10.1016/j.disc.2024.113962
arXiv: 2301.11615

Anastos M. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 2023;30(2). doi:10.37236/11471
LibreCat: https://research-explorer.ista.ac.at/record/13042
DOI: 10.37236/11471
WoS: 000988285500001
arXiv: 2105.13828

Anastos M, Fabian D, Müyesser A, Szabó T. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 2023;30(3). doi:10.37236/11714
LibreCat: https://research-explorer.ista.ac.at/record/14319
DOI: 10.37236/11714
arXiv: 2212.03100

Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:10.1137/1.9781611977554.ch88
LibreCat: https://research-explorer.ista.ac.at/record/14344
DOI: 10.1137/1.9781611977554.ch88
arXiv: 2111.14759

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

Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9
LibreCat: https://research-explorer.ista.ac.at/record/14444
DOI: 10.1007/s11856-023-2513-9
arXiv: 2202.05088

Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erds–McKay conjecture. Forum of Mathematics, Pi. 2023;11. doi:10.1017/fmp.2023.17
LibreCat: https://research-explorer.ista.ac.at/record/14499
DOI: 10.1017/fmp.2023.17
arXiv: 2208.02874

Anastos M. Constructing Hamilton cycles and perfect matchings efficiently. In: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Masaryk University Press; 2023:36-41. doi:10.5817/cz.muni.eurocomb23-005
LibreCat: https://research-explorer.ista.ac.at/record/14867
DOI: 10.5817/cz.muni.eurocomb23-005
arXiv: 2209.09860

Kwan MA, Sah A, Sawhney M. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 2023;361():565-575. doi:10.5802/crmath.423
LibreCat: https://research-explorer.ista.ac.at/record/15173
DOI: 10.5802/crmath.423
arXiv: 2112.03788

Kwan MA, Sah A, Sawhney M. Large deviations in random latin squares. Bulletin of the London Mathematical Society. 2022;54(4):1420-1438. doi:10.1112/blms.12638
LibreCat: https://research-explorer.ista.ac.at/record/11186
DOI: 10.1112/blms.12638
WoS: 000779920900001
arXiv: 2106.11932

Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. In: 62nd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022. IEEE; 2022:720-726. doi:10.1109/FOCS52979.2021.00075
LibreCat: https://research-explorer.ista.ac.at/record/11145
DOI: 10.1109/FOCS52979.2021.00075
WoS: 000802209600065
arXiv: 2012.10584

Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 2022;68(6):3823-3828. doi:10.1109/TIT.2022.3148779
LibreCat: https://research-explorer.ista.ac.at/record/10775
DOI: 10.1109/TIT.2022.3148779
WoS: 000799622500022
arXiv: 2012.10584

Kwan MA, Sauermann L, Zhao Y. Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. 2022;375(6):4209-4250. doi:10.1090/tran/8614
LibreCat: https://research-explorer.ista.ac.at/record/11443
DOI: 10.1090/tran/8614
WoS: 000798461500001
arXiv: 2006.08836

Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 2022;29(3). doi:10.37236/10607
LibreCat: https://research-explorer.ista.ac.at/record/11740
DOI: 10.37236/10607
WoS: 000836200300001
arXiv: 2005.07103

Cooley O, Kang M, Pikhurko O. On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. 2022;168:1-26. doi:10.1007/s10474-022-01265-8
LibreCat: https://research-explorer.ista.ac.at/record/12151
DOI: 10.1007/s10474-022-01265-8
WoS: 000886839900006
arXiv: 2103.09114

Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091
LibreCat: https://research-explorer.ista.ac.at/record/12432
DOI: 10.1109/FOCS54457.2022.00091
WoS: 000909382900084

Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 2022;29(4). doi:10.37236/10794
LibreCat: https://research-explorer.ista.ac.at/record/12286
DOI: 10.37236/10794
WoS: 000876763300001