Fabricio S. Benevides, Ph.D.
Affiliations: | 2011 | The University of Memphis, Memphis, TN, United States |
Area:
Mathematics, Theoretical MathematicsGoogle:
"Fabricio Benevides"Parents
Sign in to add mentorBela Bollobas | grad student | 2011 | The University of Memphis | |
(On Ramsey theory and slow bootstrap percolation.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Bastos JdO, Benevides FS, Han J. (2020) The number of Gallai k-colorings of complete graphs Journal of Combinatorial Theory, Series B. 144: 1-13 |
Bastos JdO, Benevides FS, Mota GO, et al. (2019) Counting Gallai 3-colorings of complete graphs Discrete Mathematics. 342: 2618-2631 |
Benevides FS, Gerbner D, Palmer CT, et al. (2018) Identifying defective sets using queries of small size Discrete Mathematics. 341: 143-150 |
Araújo J, Benevides F, Cezar AA, et al. (2018) Circular Backbone Colorings: on matching and tree backbones of planar graphs Discrete Applied Mathematics. 251: 69-82 |
Benevides FS, Sulkowska M. (2017) Percolation and best-choice problem for powers of paths Journal of Applied Probability. 54: 343-362 |
Benevides FS, Hoppen C, Sampaio RM. (2017) Edge-colorings of graphs avoiding complete graphs with a prescribed coloring Discrete Mathematics. 340: 2143-2160 |
Benevides F, Campos V, Dourado MC, et al. (2016) The maximum infection time in the geodesic and monophonic convexities Theoretical Computer Science. 609: 287-295 |
Benevides FS, Przykucki M. (2015) Maximum Percolation Time In Two-Dimensional Bootstrap Percolation ∗ Siam Journal On Discrete Mathematics. 29: 224-251 |
Benevides F, Campos VA, Dourado MC, et al. (2015) Complexity of determining the maximum infection time in the geodetic convexity Electronic Notes in Discrete Mathematics. 50: 403-408 |
Benevides F, Campos V, Dourado MC, et al. (2015) The maximum time of 2-neighbour bootstrap percolation European Journal of Combinatorics. 48: 88-99 |