Unavoidable trees in tournaments. - Richard Mycroft; Tássio Naia (Random Struct. Algorithms, 2018)

Spanning Trees of Dense Directed Graphs. - Richard Mycroft; Tássio Naia (LAGOS, 2019)

Orientation Ramsey Thresholds for Cycles and Cliques. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Yoshiharu Kohayakawa; Tássio Naia (SIAM J. Discret. Math., 2021)

Trees Contained in Every Orientation of a Graph. - Tássio Naia (Electron. J. Comb., 2022)

Separating the edges of a graph by a linear number of paths. - Marthe Bonamy; Fábio Botler; François Dross; Tássio Naia; Jozef Skokan (CoRR, 2023)

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. - Fábio Botler; Phablo F. S. Moura; Tássio Naia (Discret. Math., 2023)

Separating the edges of a graph by cycles and by subdivisions of K4. - Fábio Botler; Tássio Naia (CoRR, 2024)

Directed graphs with lower orientation Ramsey thresholds. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Tássio Naia (RAIRO Oper. Res., 2024)

Packing large balanced trees into bipartite graphs. - Cristina G. Fernandes; Tássio Naia; Giovanne Santos; Maya Stein (Discret. Math., 2025)