Kwan, M. A., Sah, A., Sawhney, M., &; Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature.https://doi.org/10.1007/s11856-023-2513-9 

Kwan, M. A., Sah, A., Sauermann, L., &; Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erds–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press.https://doi.org/10.1017/fmp.2023.17 

Anastos, M. (2023). Constructing Hamilton cycles and perfect matchings efficiently. In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications (pp. 36–41). Prague, Czech Republic: Masaryk University Press.https://doi.org/10.5817/cz.muni.eurocomb23-005 

Kwan, M. A., Sah, A., &; Sawhney, M. (2023). Enumerating matroids and linear spaces. Comptes Rendus Mathematique. Academie des Sciences.https://doi.org/10.5802/crmath.423 

Kwan, M. A., Sah, A., &; Sawhney, M. (2022). Large deviations in random latin squares. Bulletin of the London Mathematical Society. Wiley.https://doi.org/10.1112/blms.12638 

Ferber, A., Kwan, M. A., &; Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE.https://doi.org/10.1109/FOCS52979.2021.00075 

Ferber, A., Kwan, M. A., &; Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE.https://doi.org/10.1109/TIT.2022.3148779 

Kwan, M. A., Sauermann, L., &; Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/tran/8614 

Cooley, O., Del Giudice, N., Kang, M., &; Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.https://doi.org/10.37236/10607 

Cooley, O., Kang, M., &; Pikhurko, O. (2022). On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. Springer Nature.https://doi.org/10.1007/s10474-022-01265-8 

Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/FOCS54457.2022.00091 

Cooley, O., Kang, M., &; Zalla, J. (2022). Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics.https://doi.org/10.37236/10794