Michael Anastos
Kwan Group
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 | 
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics, vol. 30, no. 2, P2.21, Electronic Journal of Combinatorics, 2023, doi:10.37236/11471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics, vol. 30, no. 3, P3.10, Electronic Journal of Combinatorics, 2023, doi:10.37236/11714.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 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.
View
| DOI
| WoS
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 |
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics, vol. 30, no. 2, P2.21, Electronic Journal of Combinatorics, 2023, doi:10.37236/11471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics, vol. 30, no. 3, P3.10, Electronic Journal of Combinatorics, 2023, doi:10.37236/11714.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 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.
View
| DOI
| WoS