Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

17 Publications


2024 | Journal Article | IST-REx-ID: 15163 | OA
R. Campbell, F. Hörsch, and B. Moore, “Decompositions into two linear forests of bounded lengths,” Discrete Mathematics, vol. 347, no. 6. Elsevier, 2024.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 13042 | OA
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 | OA
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 | OA
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 | Journal Article | IST-REx-ID: 11706 | OA
A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” Random Structures and Algorithms, vol. 62, no. 4. Wiley, pp. 1035–1055, 2023.
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=MaKw

Search

Filter Publications