default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVito Napolitano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo
:
Clubs and Their Applications. SIAM J. Appl. Algebra Geom. 8(3): 493-518 (2024)- 2023
- [j29]Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo:
Two pointsets in $ \mathrm{PG}(2,q^n) $ and the associated codes. Adv. Math. Commun. 17(1): 227-245 (2023) - [j28]Vito Napolitano, Ferdinando Zullo:
Codes with few weights arising from linear sets. Adv. Math. Commun. 17(2): 320-332 (2023) - [j27]Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo:
Classifications and constructions of minimum size linear sets on the projective line. Finite Fields Their Appl. 92: 102280 (2023) - 2022
- [j26]Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo:
Linear sets on the projective line with complementary weights. Discret. Math. 345(7): 112890 (2022) - [i3]Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo:
Clubs and their applications. CoRR abs/2209.13339 (2022) - 2021
- [j25]Vito Napolitano, Olga Polverino, Giovanni Zini, Ferdinando Zullo:
Linear sets from projection of Desarguesian spreads. Finite Fields Their Appl. 71: 101798 (2021) - [i2]Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo:
Two pointsets in PG(2, qn) and the associated codes. CoRR abs/2112.11792 (2021) - 2020
- [i1]Vito Napolitano, Ferdinando Zullo:
Codes with few weights arising from linear sets. CoRR abs/2002.07241 (2020)
2010 – 2019
- 2017
- [j24]Vito Napolitano:
Note. An inequality for the line-size sum in a finite linear space. Australas. J Comb. 68: 118-121 (2017) - 2016
- [j23]Vito Napolitano:
On quasi-Hermitian varieties in. Discret. Math. 339(2): 511-514 (2016) - 2015
- [j22]Vito Napolitano:
A Characterization of the Hermitian Variety in Finite 3-Dimensional Projective Spaces. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j21]Vito Napolitano:
Note on a class of (q+1)-sets of PG(3, q). Australas. J Comb. 59: 157-160 (2014) - 2013
- [j20]Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
On the ubiquity and utility of cyclic schemes. Australas. J Comb. 55: 95-120 (2013) - [j19]Vito Napolitano:
On (q2+q+1)(q2+q+1)-sets of class [1, m, n]2[1, m, n]2 in PG(3, q)PG(3, q). Electron. Notes Discret. Math. 40: 283-287 (2013)
2000 – 2009
- 2009
- [j18]Martin Funk, Domenico Labbate, Vito Napolitano:
Tactical (de-)compositions of symmetric configurations. Discret. Math. 309(4): 741-747 (2009) - 2008
- [j17]Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
A (0, 1)-Matrix Framework for Elliptic Semiplanes. Ars Comb. 88 (2008) - [j16]Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
Configurations graphs of neighbourhood geometries. Contributions Discret. Math. 3(1) (2008) - [j15]Vito Napolitano:
Two character sets in finite linear spaces. Contributions Discret. Math. 3(1) (2008) - [j14]Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
A family of regular graphs of girth 5. Discret. Math. 308(10): 1810-1815 (2008) - 2007
- [j13]Vito Napolitano:
Note: A new proof of an inequality for finite planar spaces. Australas. J Comb. 37: 127-130 (2007) - [j12]Vito Napolitano:
Finite {0, s, 2s}-affine linear spaces. Discret. Math. 307(17-18): 2246-2260 (2007) - 2006
- [j11]Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
On (minimal) regular graphs of girth 6. Australas. J Comb. 35: 119-132 (2006) - [j10]Nicola Durante, Vito Napolitano, Domenico Olanda:
On projective spaces PG(r, q) with r>=4. Electron. Notes Discret. Math. 26: 55-57 (2006) - 2005
- [j9]Vito Napolitano:
On some finite linear spaces with few lines. Australas. J Comb. 31: 145-160 (2005) - 2004
- [j8]Vito Napolitano:
Finite Linear Spaces With Four More Lines Than Points. Ars Comb. 70 (2004) - 2003
- [j7]Vito Napolitano:
On a class of finite linear spaces with few lines. Discret. Math. 270(1-3): 206-223 (2003) - [j6]Vito Napolitano:
Erratum to "On a class of finite linear spaces with few lines": [Discrete Mathematics 270 (2003) 207-224]. Discret. Math. 270(1-3): 224-225 (2003) - 2002
- [j5]Antonio Cossidente, Vito Napolitano:
Classical varieties and caps. Ars Comb. 63 (2002) - [j4]Vito Napolitano:
A characterization of reguli in PG(3, K) and PG(5, K). Discret. Math. 250(1-3): 171-180 (2002) - [j3]Vito Napolitano:
On finite weakly {s, t}-semiaffine linear spaces. Discret. Math. 255(1-3): 325-341 (2002) - 2000
- [j2]Nicola Durante, Vito Napolitano, Domenico Olanda:
The Grassmann Space of a Planar Space. Eur. J. Comb. 21(5): 579-584 (2000)
1990 – 1999
- 1999
- [j1]Nicola Durante, Ursula Hübsch, Vito Napolitano, Johannes Ueberberg:
A classification of finite {0, 1, 2}-inversive planes. Discret. Math. 208-209: 211-233 (1999)
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-04 19:59 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:
