Campbell, Rutger, Florian Hörsch, and Benjamin Moore. “Decompositions into Two Linear Forests of Bounded Lengths.”https://doi.org/10.1016/j.disc.2024.113962__Discrete Mathematics. Elsevier, 2024.https://doi.org/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, Michael. “A Note on Long Cycles in Sparse Random Graphs.”https://doi.org/10.37236/11471__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023.https://doi.org/10.37236/11471 .
LibreCat: https://research-explorer.ista.ac.at/record/13042
DOI: 10.37236/11471
WoS: 000988285500001
arXiv: 2105.13828

Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.”https://doi.org/10.37236/11714__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023.https://doi.org/10.37236/11714 .
LibreCat: https://research-explorer.ista.ac.at/record/14319
DOI: 10.37236/11714
arXiv: 2212.03100

Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.”https://doi.org/10.1137/1.9781611977554.ch88__In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023:2286–2323. Society for Industrial and Applied Mathematics, 2023.https://doi.org/10.1137/1.9781611977554.ch88 .
LibreCat: https://research-explorer.ista.ac.at/record/14344
DOI: 10.1137/1.9781611977554.ch88
arXiv: 2111.14759

Liebenau, Anita, Letícia Mattos, Walner Mendonca dos Santos, and Jozef Skokan. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.”https://doi.org/10.1002/rsa.21106__Random Structures and Algorithms. Wiley, 2023.https://doi.org/10.1002/rsa.21106 .
LibreCat: https://research-explorer.ista.ac.at/record/11706
DOI: 10.1002/rsa.21106
WoS: 000828530400001

Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.”https://doi.org/10.1007/s11856-023-2513-9__Israel Journal of Mathematics. Springer Nature, 2023.https://doi.org/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, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erds–McKay Conjecture.”https://doi.org/10.1017/fmp.2023.17__Forum of Mathematics, Pi. Cambridge University Press, 2023.https://doi.org/10.1017/fmp.2023.17 .
LibreCat: https://research-explorer.ista.ac.at/record/14499
DOI: 10.1017/fmp.2023.17
arXiv: 2208.02874

Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.”https://doi.org/10.5817/cz.muni.eurocomb23-005__In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 36–41. Masaryk University Press, 2023.https://doi.org/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, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.”https://doi.org/10.5802/crmath.423__Comptes Rendus Mathematique. Academie des Sciences, 2023.https://doi.org/10.5802/crmath.423 .
LibreCat: https://research-explorer.ista.ac.at/record/15173
DOI: 10.5802/crmath.423
arXiv: 2112.03788

Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Large Deviations in Random Latin Squares.”https://doi.org/10.1112/blms.12638__Bulletin of the London Mathematical Society. Wiley, 2022.https://doi.org/10.1112/blms.12638 .
LibreCat: https://research-explorer.ista.ac.at/record/11186
DOI: 10.1112/blms.12638
WoS: 000779920900001
arXiv: 2106.11932

Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/FOCS52979.2021.00075__In 62nd Annual IEEE Symposium on Foundations of Computer Science, 2022:720–26. IEEE, 2022.https://doi.org/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, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/TIT.2022.3148779__IEEE Transactions on Information Theory. IEEE, 2022.https://doi.org/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, Matthew Alan, Lisa Sauermann, and Yufei Zhao. “Extension Complexity of Low-Dimensional Polytopes.”https://doi.org/10.1090/tran/8614__Transactions of the American Mathematical Society. American Mathematical Society, 2022.https://doi.org/10.1090/tran/8614 .
LibreCat: https://research-explorer.ista.ac.at/record/11443
DOI: 10.1090/tran/8614
WoS: 000798461500001
arXiv: 2006.08836

Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.”https://doi.org/10.37236/10607__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2022.https://doi.org/10.37236/10607 .
LibreCat: https://research-explorer.ista.ac.at/record/11740
DOI: 10.37236/10607
WoS: 000836200300001
arXiv: 2005.07103

Cooley, Oliver, M. Kang, and O. Pikhurko. “On a Question of Vera T. Sós about Size Forcing of Graphons.”https://doi.org/10.1007/s10474-022-01265-8__Acta Mathematica Hungarica. Springer Nature, 2022.https://doi.org/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, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”https://doi.org/10.1109/FOCS54457.2022.00091__In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022.https://doi.org/10.1109/FOCS54457.2022.00091 .
LibreCat: https://research-explorer.ista.ac.at/record/12432
DOI: 10.1109/FOCS54457.2022.00091
WoS: 000909382900084

Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.”https://doi.org/10.37236/10794__The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2022.https://doi.org/10.37236/10794 .
LibreCat: https://research-explorer.ista.ac.at/record/12286
DOI: 10.37236/10794
WoS: 000876763300001