default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmerson L. Monte Carmelo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j23]André Guerino Castoldi
, Anderson Novaes Martinhão, Emerson Luiz do Monte Carmelo, Otávio José Neto Tinoco Neves dos Santos, Pablo Henrique Perondi:
Recursive constructions for covering schemes of strength 3. Adv. Math. Commun. 19(2): 416-436 (2025)- [j22]André Guerino Castoldi, Emerson L. Monte Carmelo:
On the number of ideals of the Niederreiter-Rosenbloom-Tsfasman poset and lower bounds on covering codes. J. Appl. Math. Comput. 71(2): 2135-2153 (2025) - 2024
- [j21]André Guerino Castoldi, Anderson Novaes Martinhão, Emerson L. Monte Carmelo, Otávio J. N. T. N. dos Santos, Pablo Henrique Perondi:
Difference schemes of strength t over finite commutative rings. Discret. Math. 347(10): 114100 (2024) - 2023
- [j20]André Guerino Castoldi, Anderson Novaes Martinhão, Emerson L. Monte Carmelo, Otávio J. N. T. N. dos Santos:
Covering schemes of strength t. Des. Codes Cryptogr. 91(11): 3563-3580 (2023) - [j19]Pablo Henrique Perondi, Emerson L. Monte Carmelo:
Perfect One-Factorizations Arising from the Lee Metric. Graphs Comb. 39(1): 8 (2023) - 2022
- [j18]André Guerino Castoldi, Anderson Novaes Martinhão, Emerson L. Monte Carmelo, Otávio J. N. T. N. dos Santos:
Invariant codes, difference schemes, and distributive quasigroups. Comput. Appl. Math. 41(8) (2022) - 2019
- [j17]André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Robson da Silva:
Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space. Comput. Appl. Math. 38(2) (2019) - [j16]Pablo Henrique Perondi, Emerson L. Monte Carmelo:
Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs. Discret. Math. 342(8): 2204-2212 (2019) - 2018
- [j15]Otávio J. N. T. N. dos Santos, Emerson L. Monte Carmelo:
A connection between sumsets and covering codes of a module. Adv. Math. Commun. 12(3): 595-605 (2018) - [j14]Pablo Henrique Perondi, Emerson L. Monte Carmelo:
Set and size multipartite Ramsey numbers for stars. Discret. Appl. Math. 250: 368-372 (2018) - 2016
- [j13]Emerson L. Monte Carmelo, Juliana Sanches:
Multicolored set multipartite Ramsey numbers. Discret. Math. 339(11): 2775-2784 (2016) - 2015
- [j12]André Guerino Castoldi, Emerson L. Monte Carmelo:
The Covering Problem in Rosenbloom-Tsfasman Spaces. Electron. J. Comb. 22(3): 3 (2015) - 2013
- [j11]Emerson L. Monte Carmelo:
Covering codes and extremal problems from invariant sets under permutations. Discret. Math. 313(3): 249-257 (2013) - [j10]Anderson Novaes Martinhão, Emerson L. Monte Carmelo:
Short covering codes arising from matchings in weighted graphs. Math. Comput. 82(281): 605-616 (2013) - 2011
- [j9]Anderson Novaes Martinhão, Emerson L. Monte Carmelo:
Short coverings and matching in weighted graphs. Electron. Notes Discret. Math. 37: 321-326 (2011) - 2010
- [j8]Carlos Mendes, Emerson L. Monte Carmelo, Marcus Poggi:
Bounds for short covering codes and reactive tabu search. Discret. Appl. Math. 158(5): 522-533 (2010) - 2009
- [j7]Emerson L. Monte Carmelo:
Invariant sets under permutation, extremal graphs, and covering codes. Electron. Notes Discret. Math. 35: 77-82 (2009) - 2008
- [j6]Emerson L. Monte Carmelo:
Configurations in projective planes and quadrilateral-star Ramsey numbers. Discret. Math. 308(17): 3986-3991 (2008) - [j5]Emerson L. Monte Carmelo, I. N. Nakaoka:
Short coverings in tridimensional spaces arising from sum-free sets. Eur. J. Comb. 29(1): 227-233 (2008) - 2004
- [j4]Adilson Gonçalves, Emerson L. Monte Carmelo:
Some geometric structures and bounds for Ramsey numbers. Discret. Math. 280(1-3): 29-38 (2004) - 2003
- [j3]Eduardo Sany Laber, Emerson L. Monte Carmelo:
A Note on multicolor bipartite Ramsey numbers for K_{2, n}. Ars Comb. 69 (2003) - 2001
- [j2]Emerson L. Monte Carmelo:
A Connection Between Coding Theory and Polarized Partition Relations. Eur. J. Comb. 22(3): 351-356 (2001) - 2000
- [j1]Walter Alexandre Carnielli, Emerson L. Monte Carmelo:
K2, 2-K1, n and K2, n-K2, n bipartite Ramsey numbers. Discret. Math. 223(1-3): 83-92 (2000)
Conference and Workshop Papers
- 2021
- [c2]Claudia J. F. Gonçalves, Emerson L. Monte Carmelo, Irene N. Nakaoka:
Polarity graphs and C4-free multipartite graphs. LAGOS 2021: 437-444 - 2019
- [c1]André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens:
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays. CAI 2019: 100-111
Informal and Other Publications
- 2022
- [i2]André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens:
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces. CoRR abs/2208.01410 (2022) - [i1]André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens:
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays. CoRR abs/2208.01412 (2022)
Coauthor Index
aka: Otávio José Neto Tinoco Neves dos Santos
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 2025-08-23 04:33 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:
