default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan De Beule
Person information
- affiliation: Vrije Universiteit Brussel, Brussels, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Jan De Beule, Jonathan Mannaert, Valentino Smaldore:
Some non-existence results on m-ovoids in classical polar spaces. Eur. J. Comb. 118: 103943 (2024)- [j34]Sam Adriaensen
, Jan De Beule, Giovanni Giuseppe Grimaldi, Jonathan Mannaert:
On m-ovoids of Q+(7,q) with q odd. Finite Fields Their Appl. 95: 102387 (2024) - 2023
- [j33]Jan De Beule, Jozefien D'haeseleer, Ferdinand Ihringer, Jonathan Mannaert:
Degree 2 Boolean Functions on Grassmann Graphs. Electron. J. Comb. 30(1) (2023) - 2022
- [j32]Jan De Beule, Jonathan Mannaert, Leo Storme:
Cameron-Liebler k-sets in subspaces and non-existence conditions. Des. Codes Cryptogr. 90(3): 633-651 (2022) - [j31]Jan De Beule, Jonathan Mannaert:
A modular equality for Cameron-Liebler line classes in projective and affine spaces of odd dimension. Finite Fields Their Appl. 82: 102047 (2022) - [j30]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)
2010 – 2019
- 2019
- [j29]Jan De Beule, Jeroen Demeyer, Sam Mattheus, Péter Sziklai:
On the cylinder conjecture. Des. Codes Cryptogr. 87(4): 879-893 (2019) - [j28]Jan De Beule, Geertrui Van de Voorde:
The minimum size of a linear set. J. Comb. Theory A 164: 109-124 (2019) - 2018
- [j27]Jan De Beule, Maarten De Boeck:
A combinatorial characterisation of embedded polar spaces. Discret. Math. 341(10): 2841-2845 (2018) - 2017
- [j26]Jan De Beule, Klaus Metsch:
On the Smallest Non-Trivial Tight Sets in Hermitian Polar Spaces. Electron. J. Comb. 24(1): 1 (2017) - [j25]Simeon Ball, Jan De Beule:
On Subsets of the Normal Rational Curve. IEEE Trans. Inf. Theory 63(6): 3658-3662 (2017) - [c1]Blair Archibald, Patrick Maier, Robert J. Stewart, Phil Trinder, Jan De Beule:
Towards Generic Scalable Parallel Combinatorial Search. PASCO@ISSAC 2017: 6:1-6:10 - 2016
- [j24]Jan De Beule, Tamás Héger, Tamás Szonyi, Geertrui Van de Voorde:
Blocking and Double Blocking Sets in Finite Planes. Electron. J. Comb. 23(2): 2 (2016) - [j23]Jan De Beule, Jeroen Demeyer, Klaus Metsch, Morgan Rodgers:
A new family of tight sets in Q+(5, q). Des. Codes Cryptogr. 78(3): 655-678 (2016) - 2014
- [j22]John Bamberg, Jan De Beule, Nicola Durante, Michel Lavrauw:
Editorial: Special issue on finite geometries in honor of Frank De Clerck. Des. Codes Cryptogr. 72(1): 1-5 (2014) - 2013
- [j21]Jan De Beule:
On large maximal partial ovoids of the parabolic quadric Q(4, q). Des. Codes Cryptogr. 68(1-3): 3-10 (2013) - [j20]Jan De Beule, Anja Hallez, Klaus Metsch, Leo Storme:
Sets of generators blocking all generators in finite classical polar spaces. J. Comb. Theory A 120(2): 318-339 (2013) - 2012
- [j19]Jan De Beule, Anja Hallez, Leo Storme:
A characterisation result on a particular class of non-weighted minihypers. Des. Codes Cryptogr. 63(2): 159-170 (2012) - [j18]Simeon Ball, Jan De Beule:
On sets of vectors of a finite vector space in which every subset of basis size is a basis II. Des. Codes Cryptogr. 65(1-2): 5-14 (2012) - 2010
- [j17]Jan De Beule, Yves Edel, Emilia Käsper, Andreas Klein, Svetla Nikova, Bart Preneel, Jeroen Schillewaert, Leo Storme:
Galois geometries and applications. Des. Codes Cryptogr. 56(2-3): 85-86 (2010) - [j16]Simeon Ball, Jan De Beule, Leo Storme, Péter Sziklai, Tamás Szonyi:
In memoriam, András Gács. Des. Codes Cryptogr. 56(2-3): 87-88 (2010)
2000 – 2009
- 2009
- [j15]Jan De Beule, Patrick Govaerts, Anja Hallez, Leo Storme:
Tight sets, weighted m -covers, weighted m -ovoids, and minihypers. Des. Codes Cryptogr. 50(2): 187-201 (2009) - 2008
- [j14]Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound. Adv. Math. Commun. 2(3): 261-272 (2008) - [j13]Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme:
Partial ovoids and partial spreads in hermitian polar spaces. Des. Codes Cryptogr. 47(1-3): 21-34 (2008) - [j12]Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. Des. Codes Cryptogr. 49(1-3): 187-197 (2008) - [j11]Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme:
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. Eur. J. Comb. 29(5): 1280-1297 (2008) - [j10]Jan De Beule, András Gács:
Complete arcs on the parabolic quadric Q(4, q). Finite Fields Their Appl. 14(1): 14-21 (2008) - 2007
- [j9]Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on small blocking sets of the polar spaces Q +(2 n + 1, 2) and Q +(2 n + 1, 3). Des. Codes Cryptogr. 44(1-3): 197-207 (2007) - [j8]Jan De Beule, Klaus Metsch:
The maximum size of a partial spread in H(5, q2) is q3+1. J. Comb. Theory A 114(4): 761-768 (2007) - 2006
- [j7]Jan De Beule, Leo Storme:
Blocking All Generators of Q+(2n + 1, 3), n ≥ 4. Des. Codes Cryptogr. 39(3): 323-333 (2006) - 2005
- [j6]Jan De Beule, Klaus Metsch:
The smallest point sets that meet all generators of H(2n, q2). Discret. Math. 294(1-2): 75-81 (2005) - [j5]Jan De Beule, Leo Storme:
On the smallest minimal blocking sets of Q(2n, q), for q an odd prime. Discret. Math. 294(1-2): 83-107 (2005) - [j4]Jan De Beule, Klaus Metsch:
Minimal blocking sets of size q2+2 of Q(4, q), q an odd prime, do not exist. Finite Fields Their Appl. 11(2): 305-315 (2005) - 2004
- [j3]Jan De Beule, Albert Hoogewijs, Leo Storme:
On the size of minimal blocking sets of Q(4; q), for q = 5, 7. SIGSAM Bull. 38(3): 67-84 (2004) - [j2]Jan De Beule, Klaus Metsch:
Small point sets that meet all generators of Q(2n, p), p>3 prime. J. Comb. Theory A 106(2): 327-333 (2004) - 2003
- [j1]Matthew R. Brown, Jan De Beule, Leo Storme:
Maximal partial spreads of T2(O) and T3. Eur. J. Comb. 24(1): 73-84 (2003)
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-08-03 20:13 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:
