Michael Anastos

13 Publications

Mark all

[13]
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos, Michael, et al. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics, vol. 360, Elsevier, 2025, pp. 506–11, 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, Michael, et al. “Smoothed Analysis for Graph Isomorphism.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–106, doi:10.1145/3717823.3718173.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms, vol. 66, no. 2, e21286, Wiley, 2025, doi:10.1002/rsa.21286.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[10]
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma, vol. 13, e55, Cambridge University Press, 2025, 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, Michael, and Patrick Morris. “A Note on Finding Large Transversals Efficiently.” Journal of Combinatorial Designs, Wiley, 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, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” 22nd International Conference on Theory of Cryptography, vol. 15364, Springer Nature, 2024, pp. 413–43, 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, Michael, et al. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society, vol. 110, no. 6, e70010, Wiley, 2024, doi:10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos, Michael, et al. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability, vol. 29, 70, Duke University Press, 2024, 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, 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
 
[4]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
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
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
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 | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
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 | WoS | arXiv
 
[1]
2022 | Published | 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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

Grants


13 Publications

Mark all

[13]
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos, Michael, et al. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics, vol. 360, Elsevier, 2025, pp. 506–11, 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, Michael, et al. “Smoothed Analysis for Graph Isomorphism.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–106, doi:10.1145/3717823.3718173.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms, vol. 66, no. 2, e21286, Wiley, 2025, doi:10.1002/rsa.21286.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[10]
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma, vol. 13, e55, Cambridge University Press, 2025, 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, Michael, and Patrick Morris. “A Note on Finding Large Transversals Efficiently.” Journal of Combinatorial Designs, Wiley, 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, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” 22nd International Conference on Theory of Cryptography, vol. 15364, Springer Nature, 2024, pp. 413–43, 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, Michael, et al. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society, vol. 110, no. 6, e70010, Wiley, 2024, doi:10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos, Michael, et al. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability, vol. 29, 70, Duke University Press, 2024, 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, 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
 
[4]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
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
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
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 | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
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 | WoS | arXiv
 
[1]
2022 | Published | 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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed