The 3-colored Ramsey number of even cycles. - Fabrício Siqueira Benevides; Jozef Skokan (J. Comb. Theory B, 2009)

Monochromatic Cycles in 2-Coloured Graphs. - Fabrício Siqueira Benevides; Tomasz Luczak 001; Alex Scott 001; Jozef Skokan; M. White (Comb. Probab. Comput., 2012)

A multipartite Ramsey number for odd cycles. - Fabrício Siqueira Benevides (J. Graph Theory, 2012)

On Slowly Percolating Sets of Minimal Size in Bootstrap Percolation. - Fabrício Siqueira Benevides; Michal Przykucki (Electron. J. Comb., 2013)

Connected Greedy Colourings. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Simon Griffiths; Robert Morris 001; Leonardo Sampaio Rocha; Ana Silva 001 (LATIN, 2014)

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Rudini Menezes Sampaio; Ana Silva 001 (Eur. J. Comb., 2015)

Complexity of determining the maximum infection time in the geodetic convexity. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Ana Silva 001 (Electron. Notes Discret. Math., 2015)

Maximum Percolation Time in Two-Dimensional Bootstrap Percolation. - Fabrício Siqueira Benevides; Michal Przykucki (SIAM J. Discret. Math., 2015)

The maximum infection time in the geodesic and monophonic convexities. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Rudini Menezes Sampaio; Ana Silva 001 (Theor. Comput. Sci., 2016)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. - Fabrício Benevides; Carlos Hoppen; Rudini M. Sampaio (Discret. Math., 2017)

Percolation and best-choice problem for powers of paths. - Fabrício Siqueira Benevides; Malgorzata Sulkowska (J. Appl. Probab., 2017)

Circular backbone colorings: On matching and tree backbones of planar graphs. - Júlio Araújo 001; Fabrício Benevides; Alexandre A. Cezar; Ana Silva 001 (Discret. Appl. Math., 2018)

Identifying defective sets using queries of small size. - Fabrício Benevides; Dániel Gerbner; Cory Palmer; Dominik K. Vu (Discret. Math., 2018)

Counting Gallai 3-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Guilherme Oliveira Mota; Ignasi Sau (Discret. Math., 2019)

The number of Gallai k-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Jie Han 002 (J. Comb. Theory B, 2020)

Maximizing the expected number of components in an online search of a graph. - Fabrício Siqueira Benevides; Malgorzata Sulkowska (Discret. Math., 2022)

Heilbronn triangle-type problems in the unit square [0,1]2. - Fabrício Siqueira Benevides; Carlos Hoppen; Hanno Lefmann; Knut Odermann (Random Struct. Algorithms, 2023)

Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. - Fabrício Benevides; Jean-Claude Bermond; Hicham Lesfari; Nicolas Nisse (Eur. J. Comb., 2024)

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles. - Fabrício Siqueira Benevides; Arthur Lima Quintino; Alexandre Talon (Eur. J. Comb., 2025)