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

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

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

M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, vol. 2023, pp. 2286–2323.
LibreCat: https://research-explorer.ista.ac.at/record/14344
DOI: 10.1137/1.9781611977554.ch88
arXiv: 2111.14759

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. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14444
DOI: 10.1007/s11856-023-2513-9
arXiv: 2202.05088

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

M. Anastos, “Constructing Hamilton cycles and perfect matchings efficiently,” in Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Prague, Czech Republic, 2023, pp. 36–41.
LibreCat: https://research-explorer.ista.ac.at/record/14867
DOI: 10.5817/cz.muni.eurocomb23-005
arXiv: 2209.09860

M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” Comptes Rendus Mathematique, vol. 361, no. . Academie des Sciences, pp. 565–575, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15173
DOI: 10.5802/crmath.423
arXiv: 2112.03788

M. A. Kwan, A. Sah, and M. Sawhney, “Large deviations in random latin squares,” Bulletin of the London Mathematical Society, vol. 54, no. 4. Wiley, pp. 1420–1438, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11186
DOI: 10.1112/blms.12638
WoS: 000779920900001
arXiv: 2106.11932

A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” in 62nd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022, pp. 720–726.
LibreCat: https://research-explorer.ista.ac.at/record/11145
DOI: 10.1109/FOCS52979.2021.00075
WoS: 000802209600065
arXiv: 2012.10584

A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 68, no. 6. IEEE, pp. 3823–3828, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/10775
DOI: 10.1109/TIT.2022.3148779
WoS: 000799622500022
arXiv: 2012.10584

M. A. Kwan, L. Sauermann, and Y. Zhao, “Extension complexity of low-dimensional polytopes,” Transactions of the American Mathematical Society, vol. 375, no. 6. American Mathematical Society, pp. 4209–4250, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11443
DOI: 10.1090/tran/8614
WoS: 000798461500001
arXiv: 2006.08836

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

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

M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930.
LibreCat: https://research-explorer.ista.ac.at/record/12432
DOI: 10.1109/FOCS54457.2022.00091
WoS: 000909382900084

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