Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.”10.37236/11471__Electronic Journal of Combinatorics, vol. 30, no. 2, .21, Electronic Journal of Combinatorics, 2023, doi:10.37236/11471.
LibreCat: https://research-explorer.ista.ac.at/record/13042
DOI: 10.37236/11471
WoS: 000988285500001
arXiv: 2105.13828

Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.”10.37236/11714__Electronic Journal of Combinatorics, vol. 30, no. 3, .10, Electronic Journal of Combinatorics, 2023, doi: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.”10.1137/1.9781611977554.ch88__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2023, Society for Industrial and Applied Mathematics, 2023, pp. 2286–323, doi:10.1137/1.9781611977554.ch88.
LibreCat: https://research-explorer.ista.ac.at/record/14344
DOI: 10.1137/1.9781611977554.ch88
arXiv: 2111.14759

Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.”10.5817/cz.muni.eurocomb23-005__Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 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

Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”10.1109/FOCS54457.2022.00091__63rd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091.
LibreCat: https://research-explorer.ista.ac.at/record/12432
DOI: 10.1109/FOCS54457.2022.00091
WoS: 000909382900084