Michael Anastos

Kwan Group

10 Publications

Mark all

[10]
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos, Michael, Simona Boyadzhiyska, Silas Rathke, and Juanjo Rué. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.dam.2024.10.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[9]
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. Wiley, 2025. https://doi.org/10.1002/rsa.21286.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos, Michael, Oliver Cooley, Mihyun Kang, and Matthew Alan Kwan. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society. Wiley, 2024. https://doi.org/10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos, Michael, Sahar Diskin, Dor Elboim, and Michael Krivelevich. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability. Duke University Press, 2024. https://doi.org/10.1214/24-ECP639.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[6]
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos, Michael, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Alan Kwan, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” In 22nd International Conference on Theory of Cryptography, 15364:413–43. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-78011-0_14.
[Preprint] View | DOI | Download Preprint (ext.)
 
[5]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
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
 
[4]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
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
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
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
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
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
 
[1]
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
 
Marked Publication(s)

Search

Filter Publications

  • 9 OA Fulltext(s)

Display / Sort

Citation Style: Chicago

Export / Embed

Grants


10 Publications

Mark all

[10]
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos, Michael, Simona Boyadzhiyska, Silas Rathke, and Juanjo Rué. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.dam.2024.10.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[9]
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. Wiley, 2025. https://doi.org/10.1002/rsa.21286.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos, Michael, Oliver Cooley, Mihyun Kang, and Matthew Alan Kwan. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society. Wiley, 2024. https://doi.org/10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 
[7]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos, Michael, Sahar Diskin, Dor Elboim, and Michael Krivelevich. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability. Duke University Press, 2024. https://doi.org/10.1214/24-ECP639.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[6]
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos, Michael, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Alan Kwan, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” In 22nd International Conference on Theory of Cryptography, 15364:413–43. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-78011-0_14.
[Preprint] View | DOI | Download Preprint (ext.)
 
[5]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
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
 
[4]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
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
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
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
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
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
 
[1]
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
 
Marked Publication(s)

Search

Filter Publications

  • 9 OA Fulltext(s)

Display / Sort

Citation Style: Chicago

Export / Embed