Michael Anastos
Kwan Group
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 | 
Anastos, M. (2023). A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11471
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
Anastos, M., Fabian, D., Müyesser, A., & Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11714
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch88
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
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
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
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
View
| DOI
| WoS
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 |
Anastos, M. (2023). A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11471
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
Anastos, M., Fabian, D., Müyesser, A., & Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11714
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch88
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
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
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
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
View
| DOI
| WoS