Michael Anastos

13 Publications

Mark all

[13]
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos M, Boyadzhiyska S, Rathke S, Rué J. On the chromatic number of powers of subdivisions of graphs. Discrete Applied Mathematics. 2025;360:506-511. doi:10.1016/j.dam.2024.10.002
[Published Version] View | Files available | DOI | WoS | arXiv
 
[12]
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Anastos M, Kwan MA, Moore B. Smoothed analysis for graph isomorphism. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:2098-2106. doi:10.1145/3717823.3718173
[Published Version] View | Files available | DOI | arXiv
 
[11]
2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon Y, Anastos M. The completion numbers of hamiltonicity and pancyclicity in random graphs. Random Structures and Algorithms. 2025;66(2). doi:10.1002/rsa.21286
[Published Version] View | Files available | DOI | WoS | arXiv
 
[10]
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos M, Jin Z, Kwan MA, Sudakov B. Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma. 2025;13. doi:10.1017/fms.2024.144
[Published Version] View | Files available | DOI | WoS | arXiv
 
[9]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 | OA
Anastos M, Morris P. A note on finding large transversals efficiently. Journal of Combinatorial Designs. 2025. doi:10.1002/jcd.21990
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos M, Auerbach B, Baig MA, et al. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: 22nd International Conference on Theory of Cryptography. Vol 15364. Springer Nature; 2024:413-443. doi:10.1007/978-3-031-78011-0_14
[Preprint] View | DOI | Download Preprint (ext.)
 
[7]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos M, Cooley O, Kang M, Kwan MA. Partitioning problems via random processes. Journal of the London Mathematical Society. 2024;110(6). doi:10.1112/jlms.70010
[Published Version] View | Files available | DOI | arXiv
 
[6]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos M, Diskin S, Elboim D, Krivelevich M. Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. 2024;29. doi:10.1214/24-ECP639
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[5]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
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
 
[4]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
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
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
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 | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
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 | WoS | arXiv
 
[1]
2022 | Published | 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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


13 Publications

Mark all

[13]
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos M, Boyadzhiyska S, Rathke S, Rué J. On the chromatic number of powers of subdivisions of graphs. Discrete Applied Mathematics. 2025;360:506-511. doi:10.1016/j.dam.2024.10.002
[Published Version] View | Files available | DOI | WoS | arXiv
 
[12]
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Anastos M, Kwan MA, Moore B. Smoothed analysis for graph isomorphism. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:2098-2106. doi:10.1145/3717823.3718173
[Published Version] View | Files available | DOI | arXiv
 
[11]
2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon Y, Anastos M. The completion numbers of hamiltonicity and pancyclicity in random graphs. Random Structures and Algorithms. 2025;66(2). doi:10.1002/rsa.21286
[Published Version] View | Files available | DOI | WoS | arXiv
 
[10]
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos M, Jin Z, Kwan MA, Sudakov B. Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma. 2025;13. doi:10.1017/fms.2024.144
[Published Version] View | Files available | DOI | WoS | arXiv
 
[9]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 | OA
Anastos M, Morris P. A note on finding large transversals efficiently. Journal of Combinatorial Designs. 2025. doi:10.1002/jcd.21990
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos M, Auerbach B, Baig MA, et al. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: 22nd International Conference on Theory of Cryptography. Vol 15364. Springer Nature; 2024:413-443. doi:10.1007/978-3-031-78011-0_14
[Preprint] View | DOI | Download Preprint (ext.)
 
[7]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos M, Cooley O, Kang M, Kwan MA. Partitioning problems via random processes. Journal of the London Mathematical Society. 2024;110(6). doi:10.1112/jlms.70010
[Published Version] View | Files available | DOI | arXiv
 
[6]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos M, Diskin S, Elboim D, Krivelevich M. Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. 2024;29. doi:10.1214/24-ECP639
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[5]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
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
 
[4]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
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
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
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 | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
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 | WoS | arXiv
 
[1]
2022 | Published | 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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed