default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Swartz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j18]Michael Giudici, Eric Swartz:
Locally s-arc-transitive graphs arising from product action. Ars Math. Contemp. 23(2) (2022)- [j17]Martino Garonzi
, Luise-Charlotte Kappe, Eric Swartz:
On Integers that are Covering Numbers of Groups. Exp. Math. 31(2): 425-443 (2022) - 2021
- [j16]Alex Schaefer, Eric Swartz:
Graphs that contain multiply transitive matchings. Eur. J. Comb. 92: 103236 (2021) - 2020
- [j15]Eric Swartz, Nicholas J. Werner:
On the number of reachable pairs in a digraph. Australas. J Comb. 77: 184-223 (2020)
2010 – 2019
- 2019
- [j14]Ronan Egan, Padraig Ó Catháin, Eric Swartz:
Spectra of Hadamard matrices. Australas. J Comb. 73: 501-512 (2019) - [j13]Oliver W. Gnilke, Marcus Greferath, Camilla Hollanti, Guillermo Nuñez Ponasso, Padraig Ó Catháin, Eric Swartz:
Improved user-private information retrieval via finite geometry. Des. Codes Cryptogr. 87(2-3): 665-677 (2019) - [j12]Torger Olson, Eric Swartz:
Transitive PSL(2, 11)-invariant k-arcs in PG(4, q). Des. Codes Cryptogr. 87(8): 1871-1879 (2019) - [j11]Padraig Ó Catháin, Eric Swartz:
Homomorphisms of matrix algebras and constructions of Butson-Hadamard matrices. Discret. Math. 342(12) (2019) - [j10]Eric Swartz:
On generalized quadrangles with a point regular group of automorphisms. Eur. J. Comb. 79: 60-74 (2019) - 2017
- [i1]Oliver W. Gnilke, Marcus Greferath, Camilla Hollanti, Guillermo Nuñez Ponasso, Padraig Ó Catháin, Eric Swartz:
Improved User-Private Information Retrieval via Finite Geometry. CoRR abs/1707.01551 (2017) - 2016
- [j9]Eric Swartz:
Locally 3-Arc-Transitive Regular Covers of Complete Bipartite Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j8]John Bamberg, Melissa Lee, Eric Swartz:
A note on relative hemisystems of Hermitian generalised quadrangles. Des. Codes Cryptogr. 81(1): 131-144 (2016) - [j7]Eric Swartz:
On the covering number of symmetric groups having degree divisible by six. Discret. Math. 339(11): 2593-2604 (2016) - [j6]Luise-Charlotte Kappe, Daniela Nikolova-Popova, Eric Swartz:
On the covering number of small symmetric groups and some sporadic simple groups. Groups Complex. Cryptol. 8(2): 135-154 (2016) - [j5]Luke Morgan, Eric Swartz, Gabriel Verret:
On 2-arc-transitive graphs of order kpn. J. Comb. Theory B 117: 77-87 (2016) - 2015
- [j4]Eric Swartz:
A construction of a partial difference set in the extraspecial groups of order p3 with exponent p2. Des. Codes Cryptogr. 75(2): 237-242 (2015) - 2012
- [j3]Eric Swartz:
The locally 2-arc transitive graphs admitting an almost simple group of Suzuki type. J. Comb. Theory A 119(5): 949-976 (2012) - 2011
- [j2]Ákos Seress, Eric Swartz:
A note on the girth-doubling construction for polygonal graphs. J. Graph Theory 68(3): 246-254 (2011) - 2010
- [j1]Eric Swartz:
A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth. J. Comb. Theory A 117(6): 783-789 (2010)
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-07 22:10 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:
