Michael Anastos
Kwan Group
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 | 
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
M. Anastos, Electronic Journal of Combinatorics 30 (2023).
2023 | Journal Article | IST-REx-ID: 14319 |
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
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).
2023 | Conference Paper | IST-REx-ID: 14344 |
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
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.
2023 | Conference Paper | IST-REx-ID: 14867 |
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
M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.
2022 | 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
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 |
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
M. Anastos, Electronic Journal of Combinatorics 30 (2023).
2023 | Journal Article | IST-REx-ID: 14319 |
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
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).
2023 | Conference Paper | IST-REx-ID: 14344 |
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
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.
2023 | Conference Paper | IST-REx-ID: 14867 |
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
M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.
2022 | 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
M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.