Michael Anastos
Kwan Group
5 Publications
2023 | Published | Journal Article | IST-REx-ID: 13042 | 
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14319 |
Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11714.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14344 |
Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14867 |
Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12432
Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 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.
View
| DOI
| WoS
Search
Filter Publications
Display / Sort
Export / Embed
Grants
5 Publications
2023 | Published | Journal Article | IST-REx-ID: 13042 |
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14319 |
Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11714.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14344 |
Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14867 |
Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12432
Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 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.
View
| DOI
| WoS