Unavoidable trees in tournaments R Mycroft, T Naia Random Structures & Algorithms 53 (2), 352-385, 2018 | 12 | 2018 |
Separating the edges of a graph by a linear number of paths M Bonamy, F Botler, F Dross, T Naia, J Skokan ADVANCES IN COMBINATORICS 6, 7, 2023 | 10* | 2023 |
Large structures in dense directed graphs T Naia dos Santos University of Birmingham, 2018 | 9 | 2018 |
Spanning trees of dense directed graphs R Mycroft, T Naia Electronic Notes in Theoretical Computer Science 346, 645-654, 2019 | 7 | 2019 |
Seymour's Second Neighborhood Conjecture for orientations of (pseudo) random graphs F Botler, PFS Moura, T Naia Discrete Mathematics 346 (12), 113583, 2023 | 2 | 2023 |
Trees contained in every orientation of a graph T Naia the electronic journal of combinatorics, P2. 26-P2. 26, 2022 | 2 | 2022 |
Orientation Ramsey thresholds for cycles and cliques GF Barros, BP Cavalar, Y Kohayakawa, T Naia SIAM Journal on Discrete Mathematics 35 (4), 2844-2857, 2021 | 2 | 2021 |
Directed graphs with lower orientation Ramsey thresholds GF Barros, BP Cavalar, Y Kohayakawa, GO Mota, T Naia RAIRO-Operations Research 58 (4), 3607-3619, 2024 | 1 | 2024 |
Seymour's Second Neighborhood Conjecture in arbitrary orientations of a random graph F Botler, P Moura, T Naia Discrete Mathematics Days 2022 263, 58, 2022 | 1 | 2022 |
Oriented graphs with lower orientation Ramsey thresholds GF Barros, BP Cavalar, Y Kohayakawa, GO Mota, T Naia Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | 1 | 2021 |
Separating the edges of a graph by cycles and by subdivisions of F Botler, T Naia arXiv preprint arXiv:2407.02102, 2024 | | 2024 |
Cobertura de grafos aleatórios por caminhos multicoloridos A Kaique, GO Mota, T Naia Anais do VIII Encontro de Teoria da Computação, 1-5, 2023 | | 2023 |
Separating cycle systems F Botler, T Naia Discrete Mathematics Days 2024, 48, 0 | | |
Variantes da Torre de Hanói TN dos Santos, JAR Soares | | |