Michael Anastos
Kwan Group
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 |
M. Anastos, “A note on long cycles in sparse random graphs,” Electronic Journal of Combinatorics, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” Electronic Journal of Combinatorics, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, vol. 2023, pp. 2286–2323.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
M. Anastos, “Constructing Hamilton cycles and perfect matchings efficiently,” in Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Prague, Czech Republic, 2023, pp. 36–41.
[Published Version]
View
| Files available
| DOI
| arXiv
5 Publications
2023 | Journal Article | IST-REx-ID: 13042 |
M. Anastos, “A note on long cycles in sparse random graphs,” Electronic Journal of Combinatorics, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” Electronic Journal of Combinatorics, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, vol. 2023, pp. 2286–2323.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
M. Anastos, “Constructing Hamilton cycles and perfect matchings efficiently,” in Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Prague, Czech Republic, 2023, pp. 36–41.
[Published Version]
View
| Files available
| DOI
| arXiv