default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimone Costa
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Simone Costa, Anita Pasotti:
On the number of non-isomorphic (simple) k-gonal biembeddings of complete multipartite graphs. Ars Math. Contemp. 24(4): 4 (2024)- [j17]Simone Costa, Lorenzo Mella, Anita Pasotti:
Weak Heffter Arrays and Biembedding Graphs on Non-Orientable Surfaces. Electron. J. Comb. 31(1) (2024) - 2023
- [j16]Simone Costa, Tommaso Traetta:
Factorizing the Rado graph and infinite complete graphs. Ars Math. Contemp. 24(1): 1 (2023) - [j15]Simone Costa, Marco Dalai
, Stefano Della Fiore:
Variations on the Erdős distinct-sums problem. Discret. Appl. Math. 325: 172-185 (2023) - 2022
- [j14]Simone Costa, Stefano Della Fiore, M. A. Ollis, Sarah Z. Rovner-Frydman:
On Sequences in Cyclic Groups with Distinct Partial Sums. Electron. J. Comb. 29(3) (2022) - [j13]Simone Costa, Stefano Della Fiore, Anita Pasotti:
Non-zero sum Heffter arrays and their applications. Discret. Math. 345(9): 112952 (2022) - [j12]Stefano Della Fiore, Simone Costa, Marco Dalai:
Improved Bounds for (b, k)-Hashing. IEEE Trans. Inf. Theory 68(8): 4983-4997 (2022) - 2021
- [j11]Simone Costa, Marco Dalai:
New bounds for perfect k-hashing. Discret. Appl. Math. 289: 374-382 (2021) - [j10]Simone Costa, Anita Pasotti:
On λ-fold relative Heffter arrays and biembedding multigraphs on surfaces. Eur. J. Comb. 97: 103370 (2021) - [j9]Simone Costa, Marco Dalai:
A gap in the slice rank of k-tensors. J. Comb. Theory A 177: 105335 (2021) - [c2]Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. ISIT 2021: 256-261 - [i3]Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. CoRR abs/2101.10916 (2021) - 2020
- [j8]Simone Costa, Marco Dalai, Anita Pasotti:
A tour problem on a toroidal board. Australas. J Comb. 76: 183-207 (2020) - [j7]Simone Costa, Anita Pasotti, Marco Antonio Pellegrini:
Relative Heffter arrays and biembeddings. Ars Math. Contemp. 18(2): 241-271 (2020) - [j6]Yanxun Chang, Simone Costa, Tao Feng, Xiaomiao Wang:
Strong difference families of special types. Discret. Math. 343(4): 111776 (2020) - [i2]Simone Costa, Marco Dalai:
New bounds for perfect k-hashing. CoRR abs/2002.11025 (2020) - [i1]Stefano Della Fiore, Simone Costa, Marco Dalai:
Further strengthening of upper bounds for perfect k-Hashing. CoRR abs/2012.00620 (2020)
2010 – 2019
- 2018
- [j5]Simone Costa, Tao Feng, Xiaomiao Wang:
Frame difference families and resolvable balanced incomplete block designs. Des. Codes Cryptogr. 86(12): 2725-2745 (2018) - [j4]Simone Costa, Fiorenza Morini, Anita Pasotti, Marco Antonio Pellegrini:
A problem on partial sums in abelian groups. Discret. Math. 341(3): 705-712 (2018) - [j3]Simone Costa, Tao Feng, Xiaomiao Wang:
New 2-designs from strong difference families. Finite Fields Their Appl. 50: 391-405 (2018) - 2016
- [j2]Simone Costa:
On MPS construction of blocking sets in projective spaces: A generalization. Discret. Math. 339(2): 946-956 (2016) - 2014
- [c1]Hugo N. Bendini, Wilson S. Moraes, Simone Costa, Eymar Silva Sampaio Lopes, Thales Sehn Körting, Leila Maria Garcia Fonseca:
Proposta de Sistema de Monitoramento da Sigatoka-Negra Baseado em Variáveis Ambientais Utilizando o TerraMA2. GeoInfo 2014: 168-173 - 2013
- [j1]Simone Costa:
Blocking Sets in PG(r, q2n)PG(r, q2n). Electron. Notes Discret. Math. 40: 77-81 (2013)
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 2025-01-21 00:21 CET 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:
