default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSam Mattheus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j12]Sam Mattheus, Geertrui Van de Voorde:
Upper bounds for the number of substructures in finite geometries from the container method. J. Comb. Theory, Ser. A 210: 105968 (2025)- 2023
- [j11]Stephen P. Glasby
, Ferdinand Ihringer, Sam Mattheus:
The proportion of non-degenerate complementary subspaces in classical spaces. Des. Codes Cryptogr. 91(9): 2879-2891 (2023) - 2022
- [j10]Jessica Bariffi, Sam Mattheus, Alessandro Neri, Joachim Rosenthal:
Moderate-density parity-check codes from projective bundles. Des. Codes Cryptogr. 90(12): 2943-2966 (2022) - [j9]Sam Mattheus, Francesco Pavese:
A clique-free pseudorandom subgraph of the pseudo polarity graph. Discret. Math. 345(7): 112871 (2022) - [j8]Jan De Beule, Sam Mattheus, Klaus Metsch:
An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings. J. Comb. Theory A 192: 105657 (2022) - [j7]Sascha Kurz, Sam Mattheus:
A Generalization of the Cylinder Conjecture for Divisible Codes. IEEE Trans. Inf. Theory 68(4): 2281-2289 (2022) - 2021
- [j6]Imre Hatala, Tamás Héger, Sam Mattheus:
New values for the bipartite Ramsey number of the four-cycle versus stars. Discret. Math. 344(5): 112320 (2021) - 2019
- [j5]Jan De Beule, Jeroen Demeyer, Sam Mattheus, Péter Sziklai:
On the cylinder conjecture. Des. Codes Cryptogr. 87(4): 879-893 (2019) - [j4]Sam Mattheus, Francesco Pavese, Leo Storme:
On the independence number of graphs related to a polarity. J. Graph Theory 92(2): 96-110 (2019) - [j3]Sam Mattheus:
Trace of Products in Finite Fields from a Combinatorial Point of View. SIAM J. Discret. Math. 33(4): 2126-2139 (2019) - 2018
- [j2]Anurag Bishnoi, Sam Mattheus, Jeroen Schillewaert:
Minimal Multiple Blocking Sets. Electron. J. Comb. 25(4): 4 (2018) - [j1]Sam Mattheus, Francesco Pavese:
Triangle-free induced subgraphs of the unitary polarity graph. Eur. J. Comb. 72: 83-96 (2018)
Informal and Other Publications
- 2024
- [i2]Ishay Haviv, Sam Mattheus, Aleksa Milojevic, Yuval Wigderson:
Larger Nearly Orthogonal Sets over Finite Fields. CoRR abs/2404.01057 (2024) - 2021
- [i1]Jessica Bariffi, Sam Mattheus, Alessandro Neri, Joachim Rosenthal:
Moderate Density Parity-Check Codes from Projective Bundles. CoRR abs/2103.09722 (2021)
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-11-19 21:42 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:
