Michael Anastos

Kwan Group

5 Publications

Mark all

[5]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
Anastos M. 2023. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 30(2), P2.21.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Anastos M, Fabian D, Müyesser A, Szabó T. 2023. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 30(3), P3.10.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Anastos M. 2023. Fast algorithms for solving the Hamilton cycle problem with high probability. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2023, 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
Anastos M. 2023. Constructing Hamilton cycles and perfect matchings efficiently. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications, 36–41.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 12432
Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022–October, 919–930.
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

  • 4 OA Fulltext(s)

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


5 Publications

Mark all

[5]
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
Anastos M. 2023. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 30(2), P2.21.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Anastos M, Fabian D, Müyesser A, Szabó T. 2023. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 30(3), P3.10.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Anastos M. 2023. Fast algorithms for solving the Hamilton cycle problem with high probability. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2023, 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
Anastos M. 2023. Constructing Hamilton cycles and perfect matchings efficiently. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications, 36–41.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 12432
Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022–October, 919–930.
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

  • 4 OA Fulltext(s)

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed