default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrício Siqueira Benevides
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]Fabrício Siqueira Benevides, Arthur Lima Quintino, Alexandre Talon:
Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles. CoRR abs/2409.03394 (2024)- 2023
- [j16]Fabrício Siqueira Benevides, Carlos Hoppen
, Hanno Lefmann, Knut Odermann:
Heilbronn triangle-type problems in the unit square [0,1]2. Random Struct. Algorithms 62(3): 585-599 (2023) - 2022
- [j15]Fabrício Siqueira Benevides, Malgorzata Sulkowska:
Maximizing the expected number of components in an online search of a graph. Discret. Math. 345(1): 112668 (2022) - 2020
- [j14]Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Jie Han:
The number of Gallai k-colorings of complete graphs. J. Comb. Theory B 144: 1-13 (2020)
2010 – 2019
- 2019
- [j13]Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau:
Counting Gallai 3-colorings of complete graphs. Discret. Math. 342(9): 2618-2631 (2019) - 2018
- [j12]Júlio Araújo, Fabrício Benevides, Alexandre A. Cezar, Ana Silva:
Circular backbone colorings: On matching and tree backbones of planar graphs. Discret. Appl. Math. 251: 69-82 (2018) - [j11]Fabrício Benevides, Dániel Gerbner, Cory Palmer, Dominik K. Vu:
Identifying defective sets using queries of small size. Discret. Math. 341(1): 143-150 (2018) - 2017
- [j10]Fabrício Benevides, Carlos Hoppen, Rudini M. Sampaio:
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. Discret. Math. 340(9): 2143-2160 (2017) - [j9]Fabrício Siqueira Benevides, Malgorzata Sulkowska:
Percolation and best-choice problem for powers of paths. J. Appl. Probab. 54(2): 343-362 (2017) - 2016
- [j8]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Rudini Menezes Sampaio, Ana Silva:
The maximum infection time in the geodesic and monophonic convexities. Theor. Comput. Sci. 609: 287-295 (2016) - [i1]Júlio Araújo, Fabrício Benevides, Alexandre A. Cezar, Ana Silva:
Circular Backbone Colorings: on matching and tree backbones of planar graphs. CoRR abs/1604.05958 (2016) - 2015
- [j7]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Rudini Menezes Sampaio, Ana Silva:
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. Eur. J. Comb. 48: 88-99 (2015) - [j6]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Ana Silva:
Complexity of determining the maximum infection time in the geodetic convexity. Electron. Notes Discret. Math. 50: 403-408 (2015) - [j5]Fabrício Siqueira Benevides, Michal Przykucki:
Maximum Percolation Time in Two-Dimensional Bootstrap Percolation. SIAM J. Discret. Math. 29(1): 224-251 (2015) - 2014
- [c1]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Simon Griffiths, Robert Morris, Leonardo Sampaio Rocha, Ana Silva:
Connected Greedy Colourings. LATIN 2014: 433-441 - 2013
- [j4]Fabrício Siqueira Benevides, Michal Przykucki:
On Slowly Percolating Sets of Minimal Size in Bootstrap Percolation. Electron. J. Comb. 20(2): 46 (2013) - 2012
- [j3]Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White:
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 57-87 (2012) - [j2]Fabrício Siqueira Benevides:
A multipartite Ramsey number for odd cycles. J. Graph Theory 71(3): 293-316 (2012)
2000 – 2009
- 2009
- [j1]Fabrício Siqueira Benevides, Jozef Skokan:
The 3-colored Ramsey number of even cycles. J. Comb. Theory B 99(4): 690-708 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
