Michael Anastos

Kwan Group

8 Publications

Mark all

[8]
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18478 | OA
On the chromatic number of powers of subdivisions of graphs
M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2024) 506–511.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[7]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Partitioning problems via random processes
M. Anastos, O. Cooley, M. Kang, M.A. Kwan, Journal of the London Mathematical Society 110 (2024).
[Published Version] View | Files available | DOI | arXiv
 
[6]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Climbing up a random subgraph of the hypercube
M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[5]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | arXiv
 
[4]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Fast algorithms for solving the Hamilton cycle problem with high probability
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
A note on long cycles in sparse random graphs
M. Anastos, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
Constructing Hamilton cycles and perfect matchings efficiently
M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 12432
Solving the Hamilton cycle problem fast on average
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

  • 7 OA Fulltext(s)

Display / Sort

Export / Embed

Grants


8 Publications

Mark all

[8]
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18478 | OA
On the chromatic number of powers of subdivisions of graphs
M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2024) 506–511.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[7]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Partitioning problems via random processes
M. Anastos, O. Cooley, M. Kang, M.A. Kwan, Journal of the London Mathematical Society 110 (2024).
[Published Version] View | Files available | DOI | arXiv
 
[6]
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Climbing up a random subgraph of the hypercube
M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[5]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | arXiv
 
[4]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Fast algorithms for solving the Hamilton cycle problem with high probability
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
A note on long cycles in sparse random graphs
M. Anastos, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
Constructing Hamilton cycles and perfect matchings efficiently
M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 12432
Solving the Hamilton cycle problem fast on average
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

  • 7 OA Fulltext(s)

Display / Sort

Export / Embed