default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaarten De Boeck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker
:
On the Existence of Small Strictly Neumaier Graphs. Graphs Comb. 40(3): 51 (2024)- 2023
- [j19]Maarten De Boeck, Geertrui Van de Voorde:
Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order p2. Des. Codes Cryptogr. 91(3): 895-920 (2023) - [j18]Aida Abiad, Wouter Castryck, Maarten De Boeck, Jack H. Koolen, Sjanne Zeijlemaker:
An infinite class of Neumaier graphs and non-existence results. J. Comb. Theory A 193: 105684 (2023) - 2022
- [j17]Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer:
Correction to: Cameron-Liebler sets of k-spaces in ${{\, \mathrm{PG}\, }}(n, q)$. Des. Codes Cryptogr. 90(2): 477-487 (2022) - [j16]Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer:
On the sunflower bound for k-spaces, pairwise intersecting in a point. Des. Codes Cryptogr. 90(9): 2101-2111 (2022) - [j15]Maarten De Boeck, Geertrui Van de Voorde:
The weight distributions of linear sets in PG(1, q5). Finite Fields Their Appl. 82: 102034 (2022) - 2020
- [j14]Maarten De Boeck, Jozefien D'haeseleer:
Equivalent definitions for (degree one) Cameron-Liebler classes of generators in finite classical polar spaces. Discret. Math. 343(1): 111642 (2020)
2010 – 2019
- 2019
- [j13]Maarten De Boeck, Geertrui Van de Voorde:
Elation KM-Arcs. Comb. 39(3): 501-544 (2019) - [j12]Aart Blokhuis, Maarten De Boeck, Jozefien D'haeseleer:
Cameron-Liebler sets of k-spaces in $${{\mathrm{PG}}}(n, q)$$ PG ( n , q ). Des. Codes Cryptogr. 87(8): 1839-1856 (2019) - [j11]Maarten De Boeck, Morgan Rodgers, Leo Storme, Andrea Svob:
Cameron-Liebler sets of generators in finite classical polar spaces. J. Comb. Theory A 167: 340-388 (2019) - 2018
- [j10]Maarten De Boeck, Geertrui Van de Voorde:
A New Lower Bound for the Size of an Affine Blocking Set. Electron. J. Comb. 25(4): 4 (2018) - [j9]Jan De Beule, Maarten De Boeck:
A combinatorial characterisation of embedded polar spaces. Discret. Math. 341(10): 2841-2845 (2018) - 2016
- [j8]Maarten De Boeck, Leo Storme, Andrea Svob:
The Cameron-Liebler problem for sets. Discret. Math. 339(2): 470-474 (2016) - 2015
- [j7]Maarten De Boeck:
The largest Erdős-Ko-Rado sets in 2-(v, k, 1) designs. Des. Codes Cryptogr. 75(3): 465-481 (2015) - [j6]Maarten De Boeck:
Small maximal partial t-spreads in PG(2t+1, q). Eur. J. Comb. 45: 47-58 (2015) - 2014
- [j5]Maarten De Boeck, Peter Vandendriessche:
On the dual code of points and generators on the Hermitian variety H(2n+1, q2). Adv. Math. Commun. 8(3): 281-296 (2014) - [j4]Daniele Bartoli, Maarten De Boeck, Stefania Fanali, Leo Storme:
On the functional codes defined by quadrics and Hermitian varieties. Des. Codes Cryptogr. 71(1): 21-46 (2014) - [j3]Aart Blokhuis, Maarten De Boeck, Francesco Mazzocca, Leo Storme:
The Kakeya problem: a gap in the spectrum and classification of the smallest examples. Des. Codes Cryptogr. 72(1): 21-31 (2014) - [j2]Maarten De Boeck:
The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces. Des. Codes Cryptogr. 72(1): 77-117 (2014) - 2012
- [j1]Maarten De Boeck:
Small weight codewords in the dual code of points and hyperplanes in PG(n, q), q even. Des. Codes Cryptogr. 63(2): 171-182 (2012) - 2010
- [i1]Yuichiro Fujiwara, David Clark, Peter Vandendriessche, Maarten De Boeck, Vladimir D. Tonchev:
Entanglement-assisted quantum low-density parity-check codes. CoRR abs/1008.4747 (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-08-05 20:23 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:
