Michael Anastos
Kwan Group
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 | 
Anastos M. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 2023;30(2). doi: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. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 2023;30(3). doi:10.37236/11714
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:10.1137/1.9781611977554.ch88
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
Anastos M. Constructing Hamilton cycles and perfect matchings efficiently. In: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Masaryk University Press; 2023:36-41. doi:10.5817/cz.muni.eurocomb23-005
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091
View
| DOI
| WoS
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 |
Anastos M. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 2023;30(2). doi: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. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 2023;30(3). doi:10.37236/11714
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:10.1137/1.9781611977554.ch88
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
Anastos M. Constructing Hamilton cycles and perfect matchings efficiently. In: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Masaryk University Press; 2023:36-41. doi:10.5817/cz.muni.eurocomb23-005
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091
View
| DOI
| WoS